Hamiltonian cycles in regular graphs of moderate degree

DOI10.1016/0095-8956(77)90063-6zbMATH Open0374.05037OpenAlexW2170981445MaRDI QIDQ1245232FDOQ1245232

P. 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

Recommendations

• Hamilton cycles in regular 3-connected graphs
• scientific article; zbMATH DE number 3966120
• scientific article; zbMATH DE number 3929043
• Hamiltonicity in connected regular graphs
• Hamilton cycles in almost-regular 2-connected graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Some Theorems on Abstract Graphs
• A class of Hamiltonian regular graphs
• Title not available (Why is that?)

Cited In (18)

• Long path connectivity of regular graphs
• Complexity of the hamiltonian cycle in regular graph problem
• A lower bound on the number of hamiltonian cycles
• Title not available (Why is that?)
• Title not available (Why is that?)
• A remark on two sufficient conditions for Hamilton cycles
• Title not available (Why is that?)
• Hamilton cycles in almost-regular 2-connected graphs
• Title not available (Why is that?)
• Hamiltonicity, minimum degree and leaf number
• Loose Hamilton Cycles in Regular Hypergraphs
• Dominating cycles in regular 3-connected graphs
• Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
• Hamilton cycles in regular 3-connected graphs
• Hamilton cycles in regular 2-connected graphs
• Hamiltonian cycles in regular graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245232)