Hamiltonian cycles in regular graphs of moderate degree

DOI10.1016/0095-8956(77)90063-6zbMath0374.05037OpenAlexW2170981445MaRDI QIDQ1245232

Paul Erdős, Arthur M. Hobbs

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(77)90063-6

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (6)

Hamiltonicity, minimum degree and leaf number ⋮ Long path connectivity of regular graphs ⋮ Dominating cycles in regular 3-connected graphs ⋮ Hamilton cycles in regular 3-connected graphs ⋮ Hamilton cycles in regular 2-connected graphs ⋮ A remark on two sufficient conditions for Hamilton cycles

Cites Work

• A class of Hamiltonian regular graphs
• Some Theorems on Abstract Graphs
• Unnamed Item

This page was built for publication: Hamiltonian cycles in regular graphs of moderate degree