A degree sum condition for longest cycles in 3-connected graphs

DOI10.1002/jgt.20210zbMath1124.05052OpenAlexW4246222472MaRDI QIDQ3437003

Tomoki Yamashita

Publication date: 11 May 2007

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20210

zbMATH Keywords

connectivitycircumferencedegree sumlongest circle

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (3)

Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Degree sum conditions for the circumference of 4-connected graphs ⋮ Forbidden pairs and the existence of a dominating cycle

Cites Work

• On degree sum conditions for long cycles and cycles through specified vertices
• Unnamed Item

This page was built for publication: A degree sum condition for longest cycles in 3-connected graphs