Graph powers and \(k\)-ordered hamiltonicity

DOI10.1016/j.disc.2007.06.027zbMath1163.05039arXivmath/0307359OpenAlexW1978219832MaRDI QIDQ932592

Denis Chebikin

Publication date: 11 July 2008

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

Full work available at URL: https://arxiv.org/abs/math/0307359

zbMATH Keywords

Hamiltonian cyclesgraph powersk-ordered Hamiltonian

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Biclique-colouring verification complexity and biclique-colouring power graphs ⋮ Colouring clique-hypergraphs of circulant graphs ⋮ Linear-time algorithms for tree root problems

Cites Work

• k-ordered Hamiltonian graphs
• Survey of results on \(k\)-ordered graphs
• Forbidden subgraphs that imply \(k\)-ordered and \(k\)-ordered Hamiltonian
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph powers and \(k\)-ordered hamiltonicity