The linear 2-arboricity of IC-planar graphs

DOI10.1016/j.dam.2023.05.019zbMath1520.05078MaRDI QIDQ6166036

Jiangxu Kong, Dongdong Zhang, Xiaoxue Hu, Unnamed Author

Publication date: 2 August 2023

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

zbMATH Keywords

maximum degreelinear 2-arboricityedge-partitionIC-planar graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the linear 2-arboricity of planar graphs
• On linear k-arboricity
• An improved upper bound on the linear 2-arboricity of 1-planar graphs
• Planar graphs without 5-cycles or without 6-cycles
• Some problems about linear arboricity
• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
• The linear 2-arboricity of planar graphs
• Linear \(k\)-arboricities on trees
• On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
• Linear 2-arboricity of toroidal graphs
• On edge colorings of \(1\)-planar graphs
• An improved upper bound for the acyclic chromatic number of 1-planar graphs
• Light structures in 1-planar graphs with an application to linear 2-arboricity
• Acyclic coloring of IC-planar graphs
• Coloring plane graphs with independent crossings
• Chromatic number, independence ratio, and crossing number
• A new proof of the 6 color theorem
• IC-Planar Graphs Are 6-Choosable

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