Powers of connected graphs and hamiltonicity

DOI10.1016/0012-365X(84)90106-7zbMath0547.05042OpenAlexW2024832813MaRDI QIDQ798671

N. E. Zubov

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90106-7

zbMATH Keywords

power of a graphk-edge Hamiltonian

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• MinimumK-hamiltonian graphs
• Minimumk-hamiltonian graphs, II
• The cube of every connected graph is 1-hamiltonian
• The powers of a connected graph are highly hamiltonian
• Unnamed Item

This page was built for publication: Powers of connected graphs and hamiltonicity