Toughness, degrees and 2-factors

DOI10.1016/j.disc.2004.05.008zbMath1060.05056OpenAlexW2067068600MaRDI QIDQ1887644

Akira Saito, Ralph J. Faudree, Michael S. Jacobson, Linda Lesniak, Ronald J. Gould

Publication date: 22 November 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.05.008

zbMATH Keywords

toughnessHamiltonian graphsDegrees2-Factor, cycle

Mathematics Subject Classification ID

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

Related Items (3)

Toughness of the corona of two graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Toughness in graphs -- a survey

Cites Work

• Edge disjoint placement of graphs
• Cycles in 2-factors of balanced bipartite graphs
• On Maximal Circuits in Finite Graphs
• Embedding Arbitrary Graphs of Maximum Degree Two
• Degree conditions for 2-factors
• Some Theorems on Abstract Graphs

This page was built for publication: Toughness, degrees and 2-factors