Solution to an open problem on 4-ordered Hamiltonian graphs

DOI10.1016/j.disc.2012.04.003zbMath1245.05080OpenAlexW2072192534MaRDI QIDQ442328

Cheng-Kuan Lin, Lih-Hsing Hsu, László Lipták, Ming Tsai, Eddie Cheng, Jimmy J. M. Tan

Publication date: 10 August 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.04.003

zbMATH Keywords

Hamiltoniangeneralized Petersen graphs4-ordered

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

2-spanning cyclability problems of some generalized Petersen graphs ⋮ Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle ⋮ Hamiltonian cycles in hypercubes with more faulty edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
• Generalized honeycomb torus
• 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
• On the Hamilton connectivity of generalized Petersen graphs
• On \(k\)-ordered bipartite graphs
• On 3-regular 4-ordered graphs
• k-ordered Hamiltonian graphs
• Survey of results on \(k\)-ordered graphs
• Forbidden subgraphs that imply \(k\)-ordered and \(k\)-ordered Hamiltonian

This page was built for publication: Solution to an open problem on 4-ordered Hamiltonian graphs