Long cycles and neighborhood union in 1-tough graphs with large degree sums

DOI10.7151/dmgt.1059zbMath0913.05064OpenAlexW2057284948MaRDI QIDQ4222376

Vũ Đình Hòa

Publication date: 7 March 1999

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1059

zbMATH Keywords

toughnesslong cyclehamiltonicity

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Graphs with large maximum degree containing no odd cycles of a given length ⋮ Toughness in graphs -- a survey

This page was built for publication: Long cycles and neighborhood union in 1-tough graphs with large degree sums