Straight-ahead walks in Eulerian graphs

DOI10.1016/j.disc.2003.09.011zbMath1042.05032OpenAlexW2057471237MaRDI QIDQ1827714

Tomaž Pisanski, Arjana Žitnik, Thomas W. Tucker

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.011

zbMATH Keywords

Eulerian embeddingGenus of a graphMedial graphStraight-ahead walk

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

Combinatorial configurations, quasiline arrangements, and systems of curves on surfaces ⋮ Oriented matroids and complete-graph embeddings on surfaces ⋮ On plane graphs with link component number equal to the nullity ⋮ On graphs determining links with maximal number of components via medial construction ⋮ The number of circles of a maximum state of a plane graph with applications ⋮ The spectrum of the vertex quadrangulation of a 4-regular toroidal graph and beyond ⋮ Extremal embedded graphs ⋮ On the component number of links from plane graphs ⋮ DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO TRIANGULAR AND HONEYCOMB LATTICES ⋮ DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO LATTICES

Cites Work

• The Gauss code problem off the plane
• Eulerian graphs and related topics. Part 1, Volume 1
• How to determine the maximum genus of a graph
• Compatible Euler tours and supplementary Eulerian vectors
• Realizations with a cut-through Eulerian circuit
• Multimatroids. II: Orthogonality, minors and connectivity
• Orthogonal A-trails of 4-regular graphs embedded in surfaces of low genus
• Generalized Embedding Schemes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Straight-ahead walks in Eulerian graphs