Linear arboricity of outer-1-planar graphs

DOI10.1007/s40305-019-00243-2zbMath1474.05109OpenAlexW2937971868WikidataQ128086237 ScholiaQ128086237MaRDI QIDQ2033994

Xin Zhang, Bi Li

Publication date: 18 June 2021

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-019-00243-2

zbMATH Keywords

polynomial-time algorithmlinear arboricitycrossingouter-1-planar graph

Mathematics Subject Classification ID

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

Related Items (2)

Total coloring of outer-1-planar graphs: the cold case ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Outer 1-planar graphs
• List total coloring of pseudo-outerplanar graphs
• Edge covering pseudo-outerplanar graphs with forests
• A linear-time algorithm for testing outer-1-planarity
• The linear arboricity of series-parallel graphs
• Recognizing Outer 1-Planar Graphs in Linear Time
• A Planar linear arboricity conjecture
• The linear arboricity of planar graphs of maximum degree seven is four
• Complexité de l'arboricité linéaire d'un graphe
• EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING
• COVERING AND PACKING IN GRAPHS, I.

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