A sufficient condition for a graph to contain two disjoint Hamiltonian cycles

DOI10.1007/BF02941377zbMath0703.05039OpenAlexW2042921428MaRDI QIDQ915741

Sein Win

Publication date: 1988

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02941377

zbMATH Keywords

graphdisjoint Hamiltonian cycles

Mathematics Subject Classification ID

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

Cites Work

• Arc coverings of graphs
• Hamilton connected graphs
• Hamiltonian Properties in the Graphs of Ore-Type-(k )
• A sufficient condition for a graph to contain three disjoint 1-factors

This page was built for publication: A sufficient condition for a graph to contain two disjoint Hamiltonian cycles