Powers of connected graphs and hamiltonicity

DOI10.1016/0012-365X(84)90106-7zbMATH Open0547.05042OpenAlexW2024832813MaRDI QIDQ798671FDOQ798671

Authors: 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

Recommendations

• Hamiltonian connectedness and a matching in powers of connected graphs
• Publication:4726283
• Graph powers and \(k\)-ordered hamiltonicity
• MinimumK-hamiltonian graphs
• The 2-hamiltonian cubes of graphs

zbMATH Keywords

power of a graphk-edge Hamiltonian

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• The cube of every connected graph is 1-hamiltonian
• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• MinimumK-hamiltonian graphs
• Minimumk-hamiltonian graphs, II
• Title not available (Why is that?)
• The powers of a connected graph are highly hamiltonian

Cited In (15)

• Hamiltonian-colored powers of strong digraphs
• Hamiltonian properties of the cube of a 2-edge connected graph
• Problem 83
• Title not available (Why is that?)
• Two edge-disjoint Hamiltonian cycles of powers of a graph
• Title not available (Why is that?)
• Minimumk-hamiltonian graphs, II
• Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon
• Title not available (Why is that?)
• Title not available (Why is that?)
• Duchet-type theorems for powers of HHD-free graphs
• Graph powers and \(k\)-ordered hamiltonicity
• MinimumK-hamiltonian graphs
• Remarks on Hamiltonian properties of powers of digraphs
• The 2-hamiltonian cubes of graphs

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

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