On k-edge-ordered graphs

DOI10.1016/J.DISC.2003.09.004MaRDI QIDQ1827702zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Survey of results on \(k\)-ordered graphs
• A study on thek-ordered hamiltonian graphs
• Onk-ordered graphs
• Ordered and ordered Hamilton digraphs
• k-ordered Hamiltonian graphs

Cites work

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

Cited in

(7)

• An eulerian trail traversing specified edges in given order
• Ordered and linked chordal graphs
• Ordered \(h\)-level graphs on the BSP model
• Set-orderedness as a generalization of \(k\)-orderedness and cyclability
• On \(k\)-ordered bipartite graphs
• On low degree \(k\)-ordered graphs
• Edge-orders

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827702)