Even circuits in planar graphs

DOI10.1016/0095-8956(81)90034-4zbMath0493.05041OpenAlexW1977688378MaRDI QIDQ1168333

P. D. Seymour

Publication date: 1981

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(81)90034-4

zbMATH Keywords

Euler graphedge-disjoint union of circuits

Mathematics Subject Classification ID

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

Related Items (20)

Even cycle decompositions of index 3 by a novel coloring technique ⋮ On 4-connected 4-regular graphs without even cycle decompositions ⋮ On even circuit decompositions of eulerian graphs ⋮ The construction and reduction of strong snarks ⋮ Smallest (1, 2)‐eulerian weight and shortest cycle covering ⋮ Even-cycle decompositions of graphs with no odd-\(K_4\)-minor ⋮ On the simultaneous edge coloring of graphs ⋮ An Eulerian exposition ⋮ Strongly even cycle decomposable 4-regular line graphs ⋮ On even cycle decompositions of 4-regular line graphs ⋮ Even cycles and even 2-factors in the line graph of a simple graph ⋮ On even cycle decompositions of line graphs of cubic graphs ⋮ Strongly Even-Cycle Decomposable Graphs ⋮ \(H\)-colorings for 4-regular graphs ⋮ Strongly even cycle decomposable non-planar line graphs ⋮ Even cycle decompositions of 4-regular graphs and line graphs ⋮ Graphs with the Circuit Cover Property ⋮ On circuit decomposition of planar Eulerian graphs ⋮ Triangle-free circuit decompositions and Petersen minor ⋮ Circuit decompositions of Eulerian graphs

Cites Work

• Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
• Polyhedral decompositions of cubic graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Even circuits in planar graphs