Dual Eulerian Properties of Plane Multigraphs

DOI10.1137/S0895480192238172MaRDI QIDQ4764342zbMATHFDO

Authors Bradley S. Carlson, C. Y. Roger Chen, Dikran S. Meliksetian

Publication date 18 July 1995

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmEuler pathdual eulerianeulerian circuitplane multigraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Eulerian partial duals of plane graphs
• Publication:4207932
• On two dual classes of planar graphs
• Series parallel extensions of plane graphs to dual-Eulerian graphs
• Dualizability of graphs
• On the enumeration of a class of plane multigraphs
• Projective-planar graphs with even duals
• Rectangular duals of planar graphs
• scientific article; zbMATH DE number 975400

Cited in

(7)

• Euler paths in series parallel graphs
• Finding Double Euler Trails of Planar Graphs in Linear Time
• Dual-Eulerian graphs. (Translated and adapted by Arjana Žitnik)
• Series parallel extensions of plane graphs to dual-Eulerian graphs
• A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
• scientific article; zbMATH DE number 4128845 (Why is no real title available?)
• Transistor chaining in static CMOS functional cells of arbitrary planar topology

This page was built for publication: Dual Eulerian Properties of Plane Multigraphs

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