On Sheehan's Conjecture for Graphs with Symmetry

DOI10.1002/jgt.21838zbMath1321.05145OpenAlexW1896292437WikidataQ122964912 ScholiaQ122964912MaRDI QIDQ2947858

Andrew Wagner, Mateja Šajna

Publication date: 29 September 2015

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

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

zbMATH Keywords

automorphism groupregular graphHamilton cycleSheehan's conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• A degree constraint for uniquely Hamiltonian graphs
• Hamiltonian circuits in Cayley graphs
• Hamiltonian decomposition of Cayley graphs of degree 4
• Independent dominating sets and a second hamiltonian cycle in regular graphs
• Vertices of small degree in uniquely Hamiltonian graphs
• Uniquely Hamiltonian Graphs of Minimum Degree 4
• Independent dominating sets and hamiltonian cycles
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
• On Hamiltonian Circuits

This page was built for publication: On Sheehan's Conjecture for Graphs with Symmetry