The linear 2-arboricity of sparse graphs

DOI10.1142/S1793830917500471MaRDI QIDQ5370820zbMATH OpenOpenAlexFDO

Authors Yuanchao Li, Xiaoxue Hu

Publication date 20 October 2017

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830917500471

zbMATH Keywords

2-degeneratelinear 2-arboricitymaximum average degreesparse graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42)

Recommendations

• scientific article; zbMATH DE number 6889807
• scientific article; zbMATH DE number 7071489
• The linear 2-arboricity of some planar graphs.
• An improved upper bound on the linear 2-arboricity of planar graphs
• Linear arboricity of degenerate graphs

Cites work

• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Algorithmic aspects of linear k-arboricity
• An improved upper bound on the linear 2-arboricity of planar graphs
• scientific article; zbMATH DE number 91047 (Why is no real title available?)
• scientific article; zbMATH DE number 1229605 (Why is no real title available?)
• scientific article; zbMATH DE number 734483 (Why is no real title available?)
• scientific article; zbMATH DE number 2192133 (Why is no real title available?)
• Linear \(k\)-arboricities on trees
• Linear 2-arboricity of toroidal graphs
• On linear k-arboricity
• On the linear k-arboricity of cubic graphs
• Planar graphs without 5-cycles or without 6-cycles
• Some problems about linear arboricity
• Strong chromatic index of 2-degenerate graphs
• The linear 2-arboricity of planar graphs
• The linear 2-arboricity of planar graphs without 4-cycles
• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5

Cited in

(4)

• Neighbor sum distinguishing list total coloring of subcubic graphs
• On linear 2-arboricity of certain graphs
• An efficient case for computing minimum linear arboricity with small maximum degree
• Linear arboricity of degenerate graphs

This page was built for publication: The linear 2-arboricity of sparse graphs

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