On the Thomassen's conjecture

DOI10.1002/JGT.1011zbMath0990.05084OpenAlexW4238700098WikidataQ122874778 ScholiaQ122874778MaRDI QIDQ2746209

Jianping Li

Publication date: 8 August 2002

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

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

zbMATH Keywords

Hamiltonian graphlongest cycle\(k\)-connected graph

Mathematics Subject Classification ID

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

Cites Work

• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
• A note on Hamiltonian circuits
• Unnamed Item

This page was built for publication: On the Thomassen's conjecture