2-factors in triangle-free graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199604)21:4<405::AID-JGT6>3.0.CO;2-T" /><405::AID-JGT6>3.0.CO;2-T 10.1002/(SICI)1097-0118(199604)21:4<405::AID-JGT6>3.0.CO;2-TzbMath0865.05060OpenAlexW2085115393MaRDI QIDQ4879177

Edward F. Schmeichel, Jan van den Heuvel, Douglas Bauer

Publication date: 29 June 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199604)21:4<405::aid-jgt6>3.0.co;2-t

zbMATH Keywords

2-factortriangle-free graphscycle structure

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 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)

Edge degrees and dominating cycles ⋮ Relative length of longest paths and longest cycles in triangle-free graphs ⋮ Toughness in graphs -- a survey

This page was built for publication: 2-factors in triangle-free graphs