Hamiltonian threshold for strong products of graphs

DOI10.1002/jgt.20314zbMath1194.05071OpenAlexW4248026952WikidataQ57601491 ScholiaQ57601491MaRDI QIDQ3630836

Ladislav Stacho, Daniel Král'

Publication date: 4 June 2009

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

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

zbMATH Keywords

Hamilton cyclepancyclic graphstrong graph product

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

On the geodetic and the hull numbers in strong product graphs ⋮ Connectivity of strong products of graphs ⋮ Cyclic colorings of plane graphs with independent faces

Cites Work

• Unnamed Item
• On factors with given components
• Advances on the Hamiltonian problem -- a survey
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Pancyclicity of strong products of graphs
• Hamiltonian circuits in certain prisms
• Hamiltonian Cycles in Strong Products of Graphs
• Updating the hamiltonian problem—A survey
• Hamiltonian Cycles in Products of Graphs
• A Survey of Combinatorial Gray Codes

This page was built for publication: Hamiltonian threshold for strong products of graphs