An improved upper bound on the linear 2-arboricity of 1-planar graphs

DOI10.1007/s10114-020-9488-9zbMath1462.05302OpenAlexW3109000230MaRDI QIDQ831027

Yi Qiao Wang, Ping Wang, Lu Zhang, Juan Liu, Wei Fan Wang

Publication date: 10 May 2021

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-020-9488-9

zbMATH Keywords

maximum degree1-planar graphlinear 2-arboricityedge-partition

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) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (3)

The linear 2-arboricity of IC-planar graphs ⋮ The linear 2-arboricity of 1-planar graphs without 3-cycles ⋮ 1-planar graphs without 4-cycles or 5-cycles are 5-colorable

Cites Work

• A note on the linear 2-arboricity of planar graphs
• On linear k-arboricity
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved upper bound on the linear 2-arboricity of 1-planar graphs