Hamilton cycles in prisms

DOI10.1002/JGT.20250MaRDI QIDQ5434258zbMATH OpenOpenAlexWikidataFDO

Authors Tomáš Kaiser, Zdeněk Ryjáček, Moshe Rosenfeld, Daniel Král', Heinz-Juergen Voss

Publication date 4 January 2008

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

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

zbMATH Keywords

graph prismsHamilton cyclesline graphsplanar graphstoughness

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Prism‐hamiltonicity of triangulations
• A characterization of Hamiltonian prisms
• The Chvátal-Erdős condition for prism-Hamiltonicity
• Hamiltonicity and pancyclicity of generalized prisms
• scientific article; zbMATH DE number 4087694

Cites work

• Graph theory with applications
• Trees in Polyhedral Graphs

Cited in

(27)

• A degree sum condition for graphs to be prism Hamiltonian
• Hamiltonicity and pancyclicity of Cartesian products of graphs
• The prism of the acyclic orientation graph is Hamiltonian
• On the Hamiltonian property hierarchy of 3-connected planar graphs
• Extendability and criticality in matching theory
• The Chvátal-Erdős condition for prism-Hamiltonicity
• A counterexample to prism-Hamiltonicity of 3-connected planar graphs
• Hardness and efficiency on \(t\)-admissibility for graph operations
• Cycles in complementary prisms
• The prism over the middle-levels graph is Hamiltonian
• Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
• Hamiltonian decomposition of prisms over cubic graphs
• On hamiltonian cycles in the prism over the odd graphs
• Closure for the property of having a hamiltonian prism
• Hamiltonicity and pancyclicity of generalized prisms
• scientific article; zbMATH DE number 1161317 (Why is no real title available?)
• A characterization of Hamiltonian prisms
• Laceability properties in prism graphs
• Matching extension in prism graphs
• Prism‐hamiltonicity of triangulations
• On 3‐polytopes with non‐Hamiltonian prisms
• Enumeration of spanning trees in prisms of some graphs
• On prism-Hamiltonian bipartite graphs
• Polyhedra without cubic vertices are prism-hamiltonian
• Hamiltonicity of Cartesian products of graphs
• On prism-Hamiltonian bipartite graphs and toughness
• Toughness and prism-Hamiltonicity of \(P_4\)-free graphs

This page was built for publication: Hamilton cycles in prisms

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