On \(k\)-edge-ordered graphs

DOI10.1016/j.disc.2003.09.004zbMath1042.05057OpenAlexW1981458075MaRDI QIDQ1827702

Denis Chebikin

Publication date: 6 August 2004

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

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

zbMATH Keywords

\(k\)-ordered\(k\)-edge-ordered Eulerian graphs

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

On low degree \(k\)-ordered graphs

Cites Work

• An eulerian trail traversing specified edges in given order
• k-ordered Hamiltonian graphs
• Survey of results on \(k\)-ordered graphs

This page was built for publication: On \(k\)-edge-ordered graphs