A characterization of Hamiltonian prisms

DOI10.1002/JGT.3190170205MaRDI QIDQ4693354zbMATH OpenOpenAlexFDO

Authors P. Paulraja

Publication date 17 August 1993

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

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

zbMATH Keywords

3-connected graphcharacterizationHamilton cycleHamiltonian prismsprism

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75)

Recommendations

• Hamilton cycles in prisms
• Prism‐hamiltonicity of triangulations
• scientific article; zbMATH DE number 4087694
• Pancyclicity of the prism
• Hamiltonian decomposition of prisms over cubic graphs

Cites work

• Graph theory with applications

Cited in

(29)

• A degree sum condition for graphs to be prism Hamiltonian
• Hamiltonicity and pancyclicity of Cartesian products of graphs
• Hamiltonian decompositions of prisms over cubic graphs
• On the Hamiltonian property hierarchy of 3-connected planar graphs
• The Chvátal-Erdős condition for prism-Hamiltonicity
• A counterexample to prism-Hamiltonicity of 3-connected planar graphs
• Cycles in complementary prisms
• Cycles through all finite vertex sets in infinite graphs
• Minimum degree conditions for the proper connection number of graphs
• The prism over the middle-levels graph is Hamiltonian
• Small cycles, generalized prisms and Hamiltonian cycles in the bubble-sort graph
• 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
• Proper connection of graphs
• Traversing every edge in each direction once, but not at once: cubic (polyhedral) graphs
• Vertex pancyclicity over lexicographic products
• Proper connection number 2, connectivity, and forbidden subgraphs
• On the minimum degree and the proper connection number of graphs
• Hamilton cycles in prisms
• Prism‐hamiltonicity of triangulations
• Pancyclicity of the prism
• On 3‐polytopes with non‐Hamiltonian prisms
• Tree 3-spanners on generalized prisms of graphs
• On prism-Hamiltonian bipartite graphs
• Polyhedra without cubic vertices are prism-hamiltonian
• Toughness and prism-Hamiltonicity of \(P_4\)-free graphs

This page was built for publication: A characterization of Hamiltonian prisms

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