Linear arboricity of planar graphs with maximum degree at least seven

DOI10.15960/J.CNKI.ISSN.1007-6093.2020.03.012MaRDI QIDQ4986052zbMATH OpenFDO

Authors Hongling Chen, Fengyan Sun, Juan Xue, Huijuan Wang, Hongwei Gao

Publication date 26 April 2021

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2020.03.012

zbMATH Keywords

cyclelinear forestplanar graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• The linear arboricity of planar graphs with maximum degree at least 7
• A result on linear arboricity of planar graphs.
• Minimum number of disjoint linear forests covering a planar graph
• An efficient case for computing minimum linear arboricity with small maximum degree
• The linear arboricity of planar graphs without 5-cycles with chords

Cited in

(6)

• A note on 1-planar graphs with minimum degree 7
• An efficient case for computing minimum linear arboricity with small maximum degree
• The linear arboricity of planar graphs with maximum degree at least 7
• The linear arboricity of planar graphs of maximum degree seven is four
• Minimum number of disjoint linear forests covering a planar graph
• The linear arboricity of planar graphs with maximum degree at least 5

This page was built for publication: Linear arboricity of planar graphs with maximum degree at least seven

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