A characterization of Hamiltonian prisms

DOI10.1002/jgt.3190170205zbMath0782.05071OpenAlexW2027062493MaRDI QIDQ4693354

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

prismcharacterization3-connected graphHamilton cycleHamiltonian prisms

Mathematics Subject Classification ID

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

Related Items (22)

Hamiltonian decompositions of prisms over cubic graphs ⋮ Vertex pancyclicity over lexicographic products ⋮ Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph ⋮ Cycles through all finite vertex sets in infinite graphs ⋮ Minimum degree conditions for the proper connection number of graphs ⋮ On 3‐polytopes with non‐Hamiltonian prisms ⋮ Tree 3-spanners on generalized prisms of graphs ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Proper connection of graphs ⋮ Unnamed Item ⋮ A counterexample to prism-Hamiltonicity of 3-connected planar graphs ⋮ Proper connection number 2, connectivity, and forbidden subgraphs ⋮ On the minimum degree and the proper connection number of graphs ⋮ The prism over the middle-levels graph is Hamiltonian ⋮ On hamiltonian cycles in the prism over the odd graphs ⋮ Toughness and prism-Hamiltonicity of \(P_4\)-free graphs ⋮ A degree sum condition for graphs to be prism Hamiltonian ⋮ Hamiltonicity and pancyclicity of Cartesian products of graphs ⋮ Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs ⋮ On the Hamiltonian property hierarchy of 3-connected planar graphs ⋮ Hamiltonicity and pancyclicity of generalized prisms ⋮ Cycles in complementary prisms

Cites Work

• Unnamed Item

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