Minimum number of disjoint linear forests covering a planar graph

DOI10.1007/s10878-013-9680-2zbMath1328.90153OpenAlexW1969869202MaRDI QIDQ405685

Weili Wu, Lidong Wu, Hui-Juan Wang, Jian Liang Wu

Publication date: 5 September 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9680-2

zbMATH Keywords

coveringcycleplanar graphlinear forest

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

A note on the minimum number of choosability of planar graphs ⋮ List edge and list total coloring of planar graphs with maximum degree 8 ⋮ An efficient case for computing minimum linear arboricity with small maximum degree ⋮ Minimum total coloring of planar graph ⋮ The linear arboricity of \(K_5\)-minor free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclically 3-colorable planar graphs
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• The linear arboricity of planar graphs with no short cycles
• The linear arboricity of graphs
• Coloring of double disk graphs
• The linear arboricity of series-parallel graphs
• The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
• Enumerating the edge-colourings and total colourings of a regular graph
• 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
• Complexité de l'arboricité linéaire d'un graphe
• Linear arboricity of random regular graphs
• COVERING AND PACKING IN GRAPHS, I.
• Linear arboricity and linear \(k\)-arboricity of regular graphs

This page was built for publication: Minimum number of disjoint linear forests covering a planar graph