A note on edge-decompositions of planar graphs

DOI10.1016/J.DISC.2003.11.017zbMATH Open1042.05083DBLPjournals/dm/HaggkvistJ04OpenAlexW2113667670WikidataQ60781980 ScholiaQ60781980MaRDI QIDQ1827795FDOQ1827795

Authors: Robert Johansson, Roland Häggkvist 

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)

Cites Work

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

Cited In (9)

• Pack graphs with subgraphs of size three
• Edges and Kuratowski Subgraphs of Non-Planar Graphs
• New upper bounds on the decomposability of planar graphs
• Minimal path decomposition of complete bipartite graphs
• P₄-Decomposition of Total Graphs
• Triangle decompositions of planar graphs
• Decomposing planar graphs into graphs with degree restrictions
• Decomposing series-parallel graphs into paths of length 3 and triangles
• Note on vertex degrees of planar graphs

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

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