Finding Double Euler Trails of Planar Graphs in Linear Time

DOI10.1137/S0097539799354321MaRDI QIDQ3149867zbMATH OpenFDO

Authors Zhi-Zhong Chen, Xin He, Chun-Hsi Huang

Publication date 29 September 2002

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539799354321

zbMATH Keywords

dual graphEuler traillinear-time algorithmplanar graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• scientific article; zbMATH DE number 4128845
• Dual Eulerian Properties of Plane Multigraphs
• The Recognition of Double Euler Trails in Series-Parallel Networks
• scientific article; zbMATH DE number 3922544
• Dual-Eulerian graphs. (Translated and adapted by Arjana Žitnik)

Cited in

(4)

• Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs
• Constant amortized time enumeration of Eulerian trails
• scientific article; zbMATH DE number 4128845 (Why is no real title available?)
• The Recognition of Double Euler Trails in Series-Parallel Networks

This page was built for publication: Finding Double Euler Trails of Planar Graphs in Linear Time

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