Toughness, degrees and 2-factors

DOI10.1016/J.DISC.2004.05.008zbMATH Open1060.05056OpenAlexW2067068600MaRDI QIDQ1887644FDOQ1887644

Authors: Akira Saito, Ralph Faudree, Ronald Gould, Michael Jacobson, Linda Lesniak 

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

Recommendations

• scientific article; zbMATH DE number 841562
• On degree sum conditions for 2-factors with a prescribed number of cycles
• Toughness, minimum degree, and the existence of 2‐factors
• Toughness and the existence of \(k\)-factors. IV
• Degree conditions for 2-factors

zbMATH Keywords

toughnessHamiltonian graphsDegrees2-Factor, cycle

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• Toughness in graphs -- a survey
• Title not available (Why is that?)
• A note on 2-factors with two components
• On degree sum conditions for 2-factors with a prescribed number of cycles
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Chordality and 2-factors in tough graphs
• Toughness of the corona of two graphs
• Degree conditions for 2-factors
• Toughness of graphs and 2-factors with given properties.
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887644)