The linear 2-arboricity of 1-planar graphs without 3-cycles

DOI10.1142/S1793830921500786zbMath1478.05061OpenAlexW3114417243MaRDI QIDQ5025157

Juan Liu, Lu Zhang

Publication date: 1 February 2022

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

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

zbMATH Keywords

maximum degree1-planar graphlinear 2-arboricityedge-partition

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On linear 2-arboricity of certain graphs

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
• The structure of 1-planar graphs
• Planar graphs without 5-cycles or without 6-cycles
• 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
• Light structures in 1-planar graphs with an application to linear 2-arboricity
• Acyclic coloring of IC-planar graphs
• On total colorings of 1-planar graphs
• A new proof of the 6 color theorem
• Acyclic colouring of 1-planar graphs

This page was built for publication: The linear 2-arboricity of 1-planar graphs without 3-cycles