The linear 2-arboricity of sparse graphs
From MaRDI portal
Publication:5370820
DOI10.1142/S1793830917500471zbMath1377.05099OpenAlexW2727246442MaRDI QIDQ5370820
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
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Density (toughness, etc.) (05C42)
Related Items (3)
An efficient case for computing minimum linear arboricity with small maximum degree ⋮ Neighbor sum distinguishing list total coloring of subcubic graphs ⋮ On linear 2-arboricity of certain graphs
Cites Work
- An improved upper bound on the linear 2-arboricity of planar graphs
- On linear k-arboricity
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- Planar graphs without 5-cycles or without 6-cycles
- Some problems about linear arboricity
- Algorithmic aspects of linear \(k\)-arboricity
- Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
- On the linear \(k\)-arboricity of cubic graphs
- The linear 2-arboricity of planar graphs
- Linear \(k\)-arboricities on trees
- Linear 2-arboricity of toroidal graphs
- Strong Chromatic Index of 2-Degenerate Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The linear 2-arboricity of sparse graphs
