List Set Colouring: Bounds and Algorithms

DOI10.1017/S0963548306007735zbMath1113.05038MaRDI QIDQ3429745

C. R. Subramanian

Publication date: 20 March 2007

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

chromatic numberpolynomial time algorithmschoice number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

\((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles

This page was built for publication: List Set Colouring: Bounds and Algorithms