Minimum number of disjoint linear forests covering a planar graph

DOI10.1007/S10878-013-9680-2MaRDI QIDQ405685zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• An efficient case for computing minimum linear arboricity with small maximum degree
• Linear arboricity of planar graphs with maximum degree at least seven
• The linear arboricity of planar graphs with maximum degree at least 7
• A result on linear arboricity of planar graphs.
• The linear arboricity of planar graphs without chordal short cycles

Cites work

• scientific article; zbMATH DE number 3989394 (Why is no real title available?)
• scientific article; zbMATH DE number 3717365 (Why is no real title available?)
• scientific article; zbMATH DE number 1299961 (Why is no real title available?)
• Acyclically 3-colorable planar graphs
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• COVERING AND PACKING IN GRAPHS, I.
• Coloring of double disk graphs
• Complexité de l'arboricité linéaire d'un graphe
• Covering and packing in graphs IV: Linear arboricity
• Enumerating the edge-colourings and total colourings of a regular graph
• Graph theory with applications
• Linear arboricity and linear k-arboricity of regular graphs
• Linear arboricity of random regular graphs
• The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups
• The linear arboricity of graphs
• The linear arboricity of planar graphs of maximum degree seven is four
• The linear arboricity of planar graphs with maximum degree at least 7
• The linear arboricity of planar graphs with no short cycles
• The linear arboricity of series-parallel graphs
• The linear arboricity of some regular graphs

Cited in

(6)

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

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

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