Toughness, minimum degree, and the existence of 2‐factors
From MaRDI portal
Publication:4290577
DOI10.1002/jgt.3190180304zbMath0795.05081OpenAlexW2038559909MaRDI QIDQ4290577
Edward F. Schmeichel, Douglas Bauer
Publication date: 11 September 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190180304
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Long cycles in graphs with prescribed toughness and minimum degree ⋮ Toughness, hamiltonicity and split graphs ⋮ Forbidden subgraphs and 2‐factors in 3/2‐tough graphs ⋮ Not every 2-tough graph is Hamiltonian ⋮ Chordality and 2-factors in tough graphs ⋮ Toughness in graphs -- a survey ⋮ Toughness, minimum degree, and spanning cubic subgraphs ⋮ Unnamed Item
Cites Work
This page was built for publication: Toughness, minimum degree, and the existence of 2‐factors
