The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal--Erdös Condition

DOI10.1137/12090037XzbMath1285.05109OpenAlexW2008247080MaRDI QIDQ5408593

Akira Saito, Songling Shan, Guantao Chen

Publication date: 10 April 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/12090037x

zbMATH Keywords

independence number2-factorHamiltonian cycletoughnessChvátal-Erdős theorem

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

Nested locally Hamiltonian graphs and the Oberly-Sumner conjecture ⋮ On degree sum conditions for 2-factors with a prescribed number of cycles ⋮ Some local-global phenomena in locally finite graphs ⋮ On Saito's conjecture and the Oberly-Sumner conjectures ⋮ Antimagic orientation of biregular bipartite graphs ⋮ Vizing's 2-factor conjecture involving toughness and maximum degree conditions ⋮ Local Dirac's condition on the existence of 2-factor ⋮ On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles ⋮ A localization method in Hamiltonian graph theory

This page was built for publication: The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal--Erdös Condition