Linear arboricity of outer-1-planar graphs

DOI10.1007/S40305-019-00243-2zbMATH Open1474.05109OpenAlexW2937971868WikidataQ128086237 ScholiaQ128086237MaRDI QIDQ2033994FDOQ2033994

Authors: 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

Recommendations

• List edge coloring of outer-1-planar graphs
• scientific article; zbMATH DE number 2192133
• An improved upper bound on the linear 2-arboricity of 1-planar graphs
• scientific article; zbMATH DE number 4112607
• The linear 2-arboricity of IC-planar graphs

zbMATH Keywords

polynomial-time algorithmcrossinglinear arboricityouter-1-planar graph

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• Title not available (Why is that?)
• Edge covering pseudo-outerplanar graphs with forests
• Recognizing outer 1-planar graphs in linear time
• Outer 1-planar graphs
• Every outer-1-plane graph has a right angle crossing drawing
• List total coloring of pseudo-outerplanar graphs
• A linear-time algorithm for testing outer-1-planarity
• The linear arboricity of series-parallel graphs
• The linear arboricity of planar graphs of maximum degree seven is four
• Title not available (Why is that?)
• Complexité de l'arboricité linéaire d'un graphe
• Title not available (Why is that?)
• COVERING AND PACKING IN GRAPHS, I.

Cited In (4)

• The structure and the list 3-dynamic coloring of outer-1-planar graphs
• Total coloring of outer-1-planar graphs: the cold case
• Conflict-free incidence coloring of outer-1-planar graphs
• On the linear vertex-arboricity of a planar graph

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

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