Linear arboricity of outer-1-planar graphs
type: Item
instance of: scholarly article
title: Linear arboricity of outer-1-planar graphs
zbMATH Open document ID: 1474.05109
author: Xin Zhang
author: Bi Li
published in: Journal of the Operations Research Society of China
publication date: 2021-06-18T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7361016
zbMATH Keywords: outer-1-planar graph
zbMATH Keywords: crossing
zbMATH Keywords: linear arboricity
zbMATH Keywords: polynomial-time algorithm
MaRDI profile type: Publication
full work available at URL: s40305-019-00243-2
OpenAlex ID: W2937971868
cites work: Q3097395
cites work: COVERING AND PACKING IN GRAPHS, I.
cites work: Q3907606
cites work: Q4248536
cites work: The linear arboricity of planar graphs of maximum degree seven is four
cites work: A planar linear arboricity conjecture
cites work: The linear arboricity of series-parallel graphs
cites work: Complexité de l'arboricité linéaire d'un graphe
cites work: Q3699704
cites work: Edge covering pseudo-outerplanar graphs with forests
cites work: List total coloring of pseudo-outerplanar graphs
cites work: Outer 1-planar graphs
cites work: EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING
cites work: Recognizing Outer 1-Planar Graphs in Linear Time
cites work: A linear-time algorithm for testing outer-1-planarity
Wikidata QID: Q128086237
DOI: 10.1007/S40305-019-00243-2
description: scientific article; zbMATH DE number 7361016