On circuit decomposition of planar Eulerian graphs

DOI10.1016/0095-8956(90)90080-JzbMath0769.05074OpenAlexW2002587338MaRDI QIDQ1814589

Herbert Fleischner, András Frank

Publication date: 25 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90080-j

zbMATH Keywords

circuit decompositionforbidden transitionsplanar Eulerian graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

On even circuit decompositions of eulerian graphs ⋮ Nowhere-zero 4-flows and cycle double covers ⋮ Cycle covers of cubic multigraphs ⋮ Graphs with the Circuit Cover Property ⋮ Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor ⋮ Circuit decompositions of Eulerian graphs ⋮ Finding paths in graphs avoiding forbidden transitions

Cites Work

• Unnamed Item
• Unnamed Item
• Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
• Even circuits in planar graphs
• On Odd Cuts and Plane Multicommodity Flows
• Graphs with the Circuit Cover Property

This page was built for publication: On circuit decomposition of planar Eulerian graphs