The linear arboricity of planar graphs with no short cycles
type: Item
instance of: scholarly article
title: The linear arboricity of planar graphs with no short cycles
zbMATH Open document ID: 1206.05035
author: Jianfeng Hou
author: Jian-Liang Wu
author: Guizhen Liu
published in: Theoretical Computer Science
publication date: 2007-09-03T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5186617
zbMATH Keywords: planar graph
zbMATH Keywords: linear arboricity
zbMATH Keywords: cycle
MaRDI profile type: Publication
full work available at URL: j.tcs.2007.05.003
OpenAlex ID: W1974658009
cites work: Q3826592
cites work: Q3907606
cites work: Covering and packing in graphs IV: Linear arboricity
cites work: Q4004078
cites work: Linear arboricity and linear \(k\)-arboricity of regular graphs
cites work: Q5422499
cites work: The linear arboricity of some regular graphs
cites work: Q3752419
cites work: COVERING AND PACKING IN GRAPHS, I.
cites work: Complexité de l'arboricité linéaire d'un graphe
cites work: Q4248536
cites work: The linear arboricity of series-parallel graphs
cites work: The linear arboricity of composition graphs
cites work: The linear arboricity of planar graphs of maximum degree seven is four
Wikidata QID: Q126263464
DOI: 10.1016/J.TCS.2007.05.003
description: scientific article; zbMATH DE number 5186617