List point arboricity of dense graphs

DOI10.1007/S00373-008-0827-3zbMath1188.05083OpenAlexW1975580069MaRDI QIDQ1043798

Lingyan Zhen, Baoyindureng Wu

Publication date: 9 December 2009

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

Full work available at URL: https://doi.org/10.1007/s00373-008-0827-3

zbMATH Keywords

list coloringpoint arboricitylist point arboricity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Density (toughness, etc.) (05C42)

Related Items (7)

LIST POINT ARBORICITY OF GRAPHS ⋮ Signed colouring and list colouring of k‐chromatic graphs ⋮ A weaker version of a conjecture on list vertex arboricity of graphs ⋮ On improperly chromatic-choosable graphs ⋮ Towards a version of Ohba's conjecture for improper colorings ⋮ List total arboricity of 2-degenerate graphs ⋮ Generalized list colouring of graphs

Cites Work

• Unnamed Item
• List colouring when the chromatic number is close to the order of the graph
• Variable degeneracy: Extensions of Brooks' and Gallai's theorems
• E ₁₁ and M theory
• LIST POINT ARBORICITY OF GRAPHS
• On chromatic‐choosable graphs
• The Point-Arboricity of Planar Graphs

This page was built for publication: List point arboricity of dense graphs