On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity

Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics
doi 10.18500/1816-9791-2018-18-3-347-353
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Saratov State University

Related search

On a Sufficient Condition for Proximity

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1979English

A New Closure Concept Preserving Graph Hamiltonicity and Based on Neighborhood Equivalence

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2011English

H∞ Filter-Slam: A Sufficient Condition for Estimation

IFAC Proceedings Volumes
2011English

A Sufficient Condition for Conjugacy of Metric Automorphisms

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1966English

A Necessary and Sufficient Condition for Lower Semicontinuity

Bulletin of the American Mathematical Society
1974English

A Sufficient Condition for Bifurcation in Random Dynamical Systems

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
2010English

A Sufficient Condition for Optimal Domain Extension of UOWHFs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Necessary and Sufficient Condition for the Lamperti Invariance Principle

Theory of Probability and Mathematical Statistics
UncertaintyStatisticsProbability
2004English

A Sufficient Condition for the Existence of Hamiltonian Bifurcations With Continuous Isotropy

Acta Mathematica Vietnamica
Mathematics
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy