Triangle decompositions of planar graphs

DOI10.7151/dmgt.1882zbMath1339.05078arXiv1504.00617OpenAlexW2964188778MaRDI QIDQ726643

Christopher M. van Bommel, Christina M. Mynhardt

Publication date: 13 July 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.00617

zbMATH Keywords

planar graphsrational triangle decompositionstriangle decompositions

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposing a planar graph with girth at least 8 into a forest and a matching
• Edge decompositions of multigraphs into 3-matchings
• Planar graphs decomposable into a forest and a matching
• A note on edge-decompositions of planar graphs
• Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
• Fractional Triangle Decompositions in Graphs with Large Minimum Degree
• T. P. Kirkman, Mathematician
• 3K2-decomposition of a graph
• The NP-Completeness of Some Edge-Partition Problems
• Edge-decompositions of graphs with high minimum degree

This page was built for publication: Triangle decompositions of planar graphs