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

DOI10.1007/S10114-020-9488-9MaRDI QIDQ831027zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 91047 (Why is no real title available?)
• scientific article; zbMATH DE number 734483 (Why is no real title available?)
• A new proof of the 6 color theorem
• A note on the linear 2-arboricity of planar graphs
• Acyclic coloring of IC-planar graphs
• Acyclic colouring of 1-planar graphs
• Light structures in 1-planar graphs with an application to linear 2-arboricity
• Linear 2-arboricity of toroidal graphs
• Linear \(k\)-arboricities on trees
• On edge colorings of \(1\)-planar graphs
• On linear k-arboricity
• On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
• On the linear arboricity of 1-planar graphs
• On total colorings of 1-planar graphs
• Planar graphs without 5-cycles or without 6-cycles
• The linear 2-arboricity of planar graphs
• The structure of 1-planar graphs
• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5

Cited in

(9)

• The linear 2-arboricity of IC-planar graphs
• Linear arboricity of outer-1-planar graphs
• 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
• An improved bound for the linear arboricity conjecture
• An improved upper bound on the linear 2-arboricity of toroidal graphs
• Light structures in 1-planar graphs with an application to linear 2-arboricity
• The linear 2-arboricity of 1-planar graphs without 3-cycles
• Linear arboricity of 1-planar graphs
• An improved upper bound on the linear 2-arboricity of planar graphs

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)