LIST POINT ARBORICITY OF GRAPHS

DOI10.1142/S1793830912500279zbMath1257.05048MaRDI QIDQ3166733

Baoyindureng Wu, Nini Xue

Publication date: 15 October 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

list coloringpoint arboricitylist point arboricity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Signed colouring and list colouring of k‐chromatic graphs ⋮ A generalization of some results on list coloring and DP-coloring ⋮ A weaker version of a conjecture on list vertex arboricity of graphs ⋮ An analogue of DP-coloring for variable degeneracy and its applications ⋮ Cover and variable degeneracy ⋮ List point arboricity of dense graphs

Cites Work

• Unnamed Item
• Planar graphs without cycles of specific lengths
• List point arboricity of dense graphs
• Choosability and edge choosability of planar graphs without five cycles
• Variable degeneracy: Extensions of Brooks' and Gallai's theorems
• Topology of series-parallel networks
• On the vertex-arboricity of planar graphs
• The point-arboricity of a graph
• On Complementary Graphs
• Covering and packing in graphs IV: Linear arboricity
• Graph colorings with local constraints -- a survey
• On the Point-Arboricity of a Graph and its Complement
• COVERING AND PACKING IN GRAPHS, I.

This page was built for publication: LIST POINT ARBORICITY OF GRAPHS