An improved upper bound on the linear 2-arboricity of planar graphs
type: Item
instance of: scholarly article
title: An improved upper bound on the linear 2-arboricity of planar graphs
zbMATH Open document ID: 1322.05045
published in: Discrete Mathematics
publication date: 2015-10-08T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6492128
zbMATH Keywords: planar graph
zbMATH Keywords: linear 2-arboricity
zbMATH Keywords: maximum degree
author: Yiqiao Wang
MaRDI profile type: Publication
full work available at URL: j.disc.2015.07.003
OpenAlex ID: W1640262016
cites work: Q4222072
cites work: On linear k-arboricity
cites work: On the total coloring of planar graphs.
cites work: Algorithmic aspects of linear \(k\)-arboricity
cites work: Linear \(k\)-arboricities on trees
cites work: On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
cites work: Q4017192
cites work: Q4326214
cites work: Some problems about linear arboricity
cites work: On the linear \(k\)-arboricity of cubic graphs
cites work: The linear 2-arboricity of planar graphs
cites work: Q5463507
cites work: Planar graphs without 5-cycles or without 6-cycles
cites work: Q3415464
cites work: Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
cites work: Q5558480
DOI: 10.1016/J.DISC.2015.07.003
description: scientific article; zbMATH DE number 6492128