Partitioning edges of a planar graph into linear forests and a matching

DOI10.1002/jgt.22995arXiv2302.13312OpenAlexW4379650722MaRDI QIDQ6081582

Unnamed Author, Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

partitioningmatchingcolouringlinear arboricityplanar graphdischarging methodlinear forest

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
• Unnamed Item
• Unnamed Item
• The linear arboricity of graphs
• Planar graphs of maximum degree seven are Class I
• The linear arboricity conjecture for 3-degenerate graphs
• A Planar linear arboricity conjecture
• The linear arboricity of planar graphs of maximum degree seven is four
• The linear arboricity of some regular graphs
• Covering and packing in graphs IV: Linear arboricity
• COVERING AND PACKING IN GRAPHS, I.

This page was built for publication: Partitioning edges of a planar graph into linear forests and a matching