Hamiltonicity of covering graphs of trees

DOI10.1016/J.DAM.2024.07.044MaRDI QIDQ6611044zbMATH OpenFDO

Authors Peter Bradshaw, Zhilin Ge, Ladislav Stacho

Publication date 26 September 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2024.07.044

zbMATH Keywords

graph circumferenceHamiltonian cyclevertex transitive graphvoltage graph

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Hamiltonian cycles in covering graphs of trees
• Hamiltonian cycles in covering graphs of trees
• Hamilton cycles in random lifts of graphs
• scientific article; zbMATH DE number 4059460
• On covering expander graphs by Hamilton cycles

Cites work

• Cayley digraphs of prime-power order are hamiltonian
• Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
• Hamilton cycles and paths in vertex-transitive graphs-current directions
• Hamiltonian cycles in covering graphs of trees
• Hamiltonian cycles in the cartesian product of a tree and a cycle
• scientific article; zbMATH DE number 3914350 (Why is no real title available?)
• scientific article; zbMATH DE number 3405992 (Why is no real title available?)
• Long cycles in vertex-transitive graphs
• On the girth of voltage graph lifts
• Voltage graphs

This page was built for publication: Hamiltonicity of covering graphs of trees

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