Solution to an open problem on 4-ordered Hamiltonian graphs
From MaRDI portal
Publication:442328
DOI10.1016/J.DISC.2012.04.003zbMATH Open1245.05080OpenAlexW2072192534MaRDI QIDQ442328FDOQ442328
Authors: Lih-Hsing Hsu, Jimmy J. M. Tan, Eddie Cheng, L. Lipták, Cheng-Kuan Lin, Ming Tsai 
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
Recommendations
- scientific article; zbMATH DE number 5257394
- Hamiltonicity of 4-connected graphs
- Hamiltonicity in graphs with few \(P_ 4\)'s
- Hamiltonicity of vertex-transitive graphs of order 4\(p\)
- scientific article; zbMATH DE number 31019
- Finding and enumerating Hamilton cycles in 4-regular graphs
- On Hamiltonicity of vertex-transitive graphs and digraphs of order \(p^4\)
- Hamiltonicity and forbidden subgraphs in 4‐connected graphs
- Solutions to Some Open Problems About Four Sombor–Index–Like Graph Invariants
Cites Work
- Survey of results on \(k\)-ordered graphs
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- On the Hamilton connectivity of generalized Petersen graphs
- Generalized honeycomb torus
- On \(k\)-ordered bipartite graphs
- On 3-regular 4-ordered graphs
- Vertex-magic total labelings of union of generalized Petersen graphs and union of special circulant graphs
- Title not available (Why is that?)
- k-ordered Hamiltonian graphs
- Title not available (Why is that?)
- Forbidden subgraphs that imply \(k\)-ordered and \(k\)-ordered Hamiltonian
Cited In (7)
- Hamiltonian cycles in hypercubes with more faulty edges
- Parameterized algorithms in smooth 4-regular Hamiltonian graphs
- 4-ordered-Hamiltonian problems of the generalized Petersen graph image
- Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
- 2-spanning cyclability problems of some generalized Petersen graphs
- On 4-ordered 3-regular graphs
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
This page was built for publication: Solution to an open problem on 4-ordered Hamiltonian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442328)
