A weaker version of a conjecture on list vertex arboricity of graphs

DOI10.1007/s00373-014-1466-5zbMath1327.05127OpenAlexW2013351576WikidataQ123356805 ScholiaQ123356805MaRDI QIDQ497380

Zhidan Yan, Baoyindureng Wu, Nini Xue, Wei Wang

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1466-5

zbMATH Keywords

list coloringvertex arboricitylist vertex arboricity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Signed colouring and list colouring of k‐chromatic graphs ⋮ Towards a version of Ohba's conjecture for improper colorings ⋮ Generalized list colouring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colouring when the chromatic number is close to the order of the graph
• List point arboricity of dense graphs
• Variable degeneracy: Extensions of Brooks' and Gallai's theorems
• On the vertex-arboricity of planar graphs
• The point-arboricity of a graph
• LIST POINT ARBORICITY OF GRAPHS
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• On chromatic‐choosable graphs
• A Proof of a Conjecture of Ohba
• The Point-Arboricity of Planar Graphs

This page was built for publication: A weaker version of a conjecture on list vertex arboricity of graphs