Linear arboricity of 1-planar graphs

DOI10.7151/DMGT.2453MaRDI QIDQ6985929zbMATH OpenFDO

Authors Weifan Wang, Juan Liu, Yiqiao Wang

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2453

zbMATH Keywords

1-planar graphlinear coloringlinear arboricity3-alternating cycle

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3717365 (Why is no real title available?)
• scientific article; zbMATH DE number 1299961 (Why is no real title available?)
• A new proof of the 6 color theorem
• A planar linear arboricity conjecture
• Acyclic colouring of 1-planar graphs
• An improved upper bound for the acyclic chromatic number of 1-planar graphs
• An improved upper bound on the linear 2-arboricity of 1-planar graphs
• COVERING AND PACKING IN GRAPHS, I.
• Covering and packing in graphs IV: Linear arboricity
• Light edges in 1-planar graphs with prescribed minimum degree
• Light structures in 1-planar graphs with an application to linear 2-arboricity
• On edge colorings of \(1\)-planar graphs
• On the linear arboricity of 1-planar graphs
• Some results on linear arboricity
• The linear arboricity of graphs
• The linear arboricity of planar graphs of maximum degree seven is four
• The linear arboricity of some regular graphs
• The structure of 1-planar graphs
• Towards the linear arboricity conjecture

This page was built for publication: Linear arboricity of 1-planar graphs

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