On 3-regular 4-ordered graphs

DOI10.1016/j.disc.2007.04.061zbMath1151.05034arXivmath/0509413OpenAlexW2166755079MaRDI QIDQ2483395

Karola Mészáros

Publication date: 28 April 2008

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

Full work available at URL: https://arxiv.org/abs/math/0509413

zbMATH Keywords

Heawood graph4-ordered graphs4-ordered hamiltonian graphs: Petersen graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

2-spanning cyclability problems of some generalized Petersen graphs ⋮ On low degree \(k\)-ordered graphs ⋮ Solution to an open problem on 4-ordered Hamiltonian graphs ⋮ On 4-ordered 3-regular graphs ⋮ Generalizing vertex pancyclic and \(k\)-ordered graphs ⋮ 4-connected triangulations and 4-orderedness

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• On \(k\)-ordered bipartite 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: On 3-regular 4-ordered graphs