The linear arboricity of \(K_5\)-minor free graphs

DOI10.1016/j.dam.2022.08.006zbMath1498.05252OpenAlexW4292488300WikidataQ113877165 ScholiaQ113877165MaRDI QIDQ2081465

Fan Yang, Huimin Song, Jian Liang Wu

Publication date: 13 October 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.08.006

zbMATH Keywords

graph minorlinear arboricitylinear forest

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum number of disjoint linear forests covering a planar graph
• The linear arboricity of planar graphs with maximum degree at least 5
• The linear arboricity of planar graphs with maximum degree at least five
• The linear arboricity of graphs
• Probabilistic methods in coloring and decomposition problems
• The linear arboricity of series-parallel graphs
• The linear arboricity of composition graphs
• Towards the linear arboricity conjecture
• Linear arboricity of regular digraphs
• The linear arboricity of planar graphs without 5-, 6-cycles with chords
• The linear arboricity of planar graphs without 5-cycles with chords
• Defective choosability of graphs without small minors
• A Planar linear arboricity conjecture
• The linear arboricity of planar graphs of maximum degree seven is four
• The linear arboricity of some regular graphs
• Linear arboricity of digraphs
• Covering and packing in graphs IV: Linear arboricity
• Complexité de l'arboricité linéaire d'un graphe
• COVERING AND PACKING IN GRAPHS, I.
• Linear arboricity and linear \(k\)-arboricity of regular graphs

This page was built for publication: The linear arboricity of \(K_5\)-minor free graphs