A note on edge-decompositions of planar graphs

DOI10.1016/j.disc.2003.11.017zbMath1042.05083OpenAlexW2113667670WikidataQ60781980 ScholiaQ60781980MaRDI QIDQ1827795

Robert Johansson, Roland Haeggkvist

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

zbMATH Keywords

FactorPlanarEdge-decompositionOuterplanar

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Decomposing series-parallel graphs into paths of length 3 and triangles ⋮ P₄-Decomposition of Total Graphs ⋮ Minimal path decomposition of complete bipartite graphs ⋮ Pack graphs with subgraphs of size three ⋮ Triangle decompositions of planar graphs

Cites Work

• From the theory of regular graphs of third and fourth degree
• Factors and factorizations of graphs—a survey
• On partitioning the edges of graphs into connected subgraphs
• P4-decompositions of regular graphs
• On factorisation of graphs
• Reguläre Faktoren von Graphen.

This page was built for publication: A note on edge-decompositions of planar graphs