A weaker version of a conjecture on list vertex arboricity of graphs
type: Item
instance of: scholarly article
title: A weaker version of a conjecture on list vertex arboricity of graphs
zbMATH Open document ID: 1327.05127
author: Baoyindureng Wu
author: Zhidan Yan
author: Nini Xue
author: Wei Wang
published in: Graphs and Combinatorics
publication date: 2015-09-24T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6484844
zbMATH Keywords: list coloring
zbMATH Keywords: vertex arboricity
zbMATH Keywords: list vertex arboricity
MaRDI profile type: Publication
full work available at URL: s00373-014-1466-5
OpenAlex ID: W2013351576
Wikidata QID: Q123356805
cites work: Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
cites work: Variable degeneracy: Extensions of Brooks' and Gallai's theorems
cites work: The Point-Arboricity of Planar Graphs
cites work: The point-arboricity of a graph
cites work: Q3922703
cites work: A Proof of a Conjecture of Ohba
cites work: On chromatic‐choosable graphs
cites work: On the vertex-arboricity of planar graphs
cites work: List colouring when the chromatic number is close to the order of the graph
cites work: Q4135588
cites work: The list point arboricity of some complete multi-partite graphs.
cites work: LIST POINT ARBORICITY OF GRAPHS
cites work: List point arboricity of dense graphs
DOI: 10.1007/S00373-014-1466-5
description: scientific article; zbMATH DE number 6484844