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

DOI10.1007/S00373-014-1466-5zbMATH Open1327.05127OpenAlexW2013351576WikidataQ123356805 ScholiaQ123356805MaRDI QIDQ497380FDOQ497380

Authors: Baoyindureng Wu, Zhidan Yan, 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

Recommendations

• The list point arboricity of some complete multi-partite graphs.
• On list vertex 2-arboricity of toroidal graphs without cycles of specific length
• List vertex arboricity of planar graphs of diameter two
• List point arboricity of graphs
• A note on the list vertex arboricity of toroidal graphs

zbMATH Keywords

list coloringvertex arboricitylist vertex arboricity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Point-Arboricity of Planar Graphs
• The point-arboricity of a graph
• On chromatic‐choosable graphs
• List colouring when the chromatic number is close to the order of the graph
• Variable degeneracy: Extensions of Brooks' and Gallai's theorems
• On the vertex-arboricity of planar graphs
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• A Proof of a Conjecture of Ohba
• List point arboricity of dense graphs
• The list point arboricity of some complete multi-partite graphs.
• LIST POINT ARBORICITY OF GRAPHS

Cited In (4)

• Towards a version of Ohba's conjecture for improper colorings
• Signed colouring and list colouring of k‐chromatic graphs
• Generalized list colouring of graphs
• A note on list arboricity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497380)