Minimum number of disjoint linear forests covering a planar graph
From MaRDI portal
Publication:405685
DOI10.1007/S10878-013-9680-2zbMATH Open1328.90153OpenAlexW1969869202MaRDI QIDQ405685FDOQ405685
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
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
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Coloring of double disk 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
- Graph theory with applications
- Acyclically 3-colorable planar graphs
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- The linear arboricity of graphs
- The linear arboricity of series-parallel graphs
- The linear arboricity of planar graphs with maximum degree at least 7
- A planar linear arboricity conjecture
- The linear arboricity of planar graphs of maximum degree seven is four
- The linear arboricity of some regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering and packing in graphs IV: Linear arboricity
- Complexité de l'arboricité linéaire d'un graphe
- Linear arboricity of random regular graphs
- Title not available (Why is that?)
- COVERING AND PACKING IN GRAPHS, I.
- Linear arboricity and linear \(k\)-arboricity of regular graphs
- The linear arboricity of planar graphs with no short cycles
Cited In (5)
- 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
- 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)
