Hamilton cycles in prisms
From MaRDI portal
Publication:5434258
DOI10.1002/jgt.20250zbMath1128.05034WikidataQ57601512 ScholiaQ57601512MaRDI QIDQ5434258
Tomáš Kaiser, Zdeněk Ryjáček, Moshe Rosenfeld, Heinz-Juergen Voss, Daniel Král'
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
05C45: Eulerian and Hamiltonian graphs
Related Items
Matching extension in prism graphs, Toughness and prism-Hamiltonicity of \(P_4\)-free graphs, A degree sum condition for graphs to be prism 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, On hamiltonian cycles in the prism over the odd graphs
Cites Work