The linear arboricity of planar graphs of maximum degree seven is four
From MaRDI portal
Publication:3522847
DOI10.1002/jgt.20305zbMath1158.05023OpenAlexW4249143621MaRDI QIDQ3522847
Publication date: 4 September 2008
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20305
Related Items (26)
A Planar linear arboricity conjecture ⋮ The linear arboricity of planar graphs without 5-, 6-cycles with chords ⋮ An efficient case for computing minimum linear arboricity with small maximum degree ⋮ Edge coloring of signed graphs ⋮ The list linear arboricity of graphs ⋮ The structure of plane graphs with independent crossings and its applications to coloring problems ⋮ Minimum number of disjoint linear forests covering a planar graph ⋮ Partitioning edges of a planar graph into linear forests and a matching ⋮ Linear arboricity of degenerate graphs ⋮ Three ways to cover a graph ⋮ A decomposition method on solving the linear arboricity conjecture ⋮ On the linear arboricity of graphs with treewidth at most four ⋮ On an \(f\)-coloring generalization of linear arboricity of multigraphs ⋮ Edge covering pseudo-outerplanar graphs with forests ⋮ Unnamed Item ⋮ The linear arboricity of planar graphs with maximum degree at least 5 ⋮ Unnamed Item ⋮ On the linear arboricity of graphs embeddable in surfaces ⋮ Towards the linear arboricity conjecture ⋮ An introduction to the discharging method via graph coloring ⋮ The linear arboricity of planar graphs with no short cycles ⋮ The conjunction of the linear arboricity conjecture and Lovász's path partition theorem ⋮ Linear arboricity of outer-1-planar graphs ⋮ The list linear arboricity of planar graphs with 7-cycles containing at most two chords ⋮ Linear arboricity of NIC-planar graphs ⋮ The linear arboricity of \(K_5\)-minor free graphs
Cites Work
This page was built for publication: The linear arboricity of planar graphs of maximum degree seven is four
