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

DOI10.1007/S10114-020-9488-9zbMATH Open1462.05302OpenAlexW3109000230MaRDI QIDQ831027FDOQ831027

Yiqiao Wang, Ping Wang, Lu Zhang, Juan Liu, Weifan 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

Recommendations

• An improved upper bound on the linear 2-arboricity of planar graphs
• The linear 2-arboricity of 1-planar graphs without 3-cycles
• Light structures in 1-planar graphs with an application to linear 2-arboricity
• An upper bound on the linear 2-arboricity of a planar graph
• Improved upper bound of linear 2-arboricity of planar graphs

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) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• A new proof of the 6 color theorem
• The structure of 1-planar graphs
• On edge colorings of \(1\)-planar graphs
• On the linear arboricity of 1-planar graphs
• Acyclic colouring of 1-planar graphs
• Linear 2-arboricity of toroidal graphs
• On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• On linear k-arboricity
• On total colorings of 1-planar graphs
• A note on the linear 2-arboricity of planar graphs
• Light structures in 1-planar graphs with an application to linear 2-arboricity
• Acyclic coloring of IC-planar graphs

Cited In (5)

• The linear 2-arboricity of IC-planar graphs
• An improved upper bound on the linear 2-arboricity of toroidal graphs
• 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
• The linear 2-arboricity of 1-planar graphs without 3-cycles
• An improved bound for the linear arboricity conjecture

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

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