Toughness, minimum degree, and the existence of 2‐factors
From MaRDI portal
Publication:4309982
DOI10.1002/jgt.3190180304zbMath0815.05042OpenAlexW2038559909MaRDI QIDQ4309982
Jan van den Heuvel, Henk Jan Veldman, Douglas Bauer, Hajo J. Broersma
Publication date: 28 November 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190180304
Related Items
Path partition number in tough graphs, Minimum degree, independence number and regular factors, A note on dominating cycles in 2-connected graphs, Not every 2-tough graph is Hamiltonian, How many conjectures can you stand? A survey, Toughness in graphs -- a survey, Toughness, forbidden subgraphs and pancyclicity, Toughness, forbidden subgraphs, and Hamilton-connected graphs, Unnamed Item
Cites Work