Brooks-type theorems for choosability with separation

DOI<43::AID-JGT7>3.0.CO;2-G 10.1002/(SICI)1097-0118(199801)27:1<43::AID-JGT7>3.0.CO;2-GzbMath0894.05016OpenAlexW1984269264MaRDI QIDQ4376504

Margit Voigt, Jan Kratochvíl, Zsolt Tuza

Publication date: 7 September 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199801)27:1<43::aid-jgt7>3.0.co;2-g

zbMATH Keywords

computational complexityvertex colouringchoosabilitylist colouringBrooks theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Coloring, sparseness and girth ⋮ A note on not-4-list colorable planar graphs ⋮ Choosability with union separation of planar graphs without cycles of length 4 ⋮ \((4,2)\)-choosability of planar graphs with forbidden structures ⋮ A sufficient condition for planar graphs to be (3,1)-choosable ⋮ Single‐conflict colouring ⋮ Choosability with union separation ⋮ 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz ⋮ List 4-colouring of planar graphs ⋮ On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) ⋮ Choosability with Separation of Complete Multipartite Graphs and Hypergraphs ⋮ Choosability with union separation of triangle-free planar graphs ⋮ On choosability with separation of planar graphs without adjacent short cycles ⋮ Choosability with separation of planar graphs without prescribed cycles ⋮ On Choosability with Separation of Planar Graphs with Forbidden Cycles ⋮ Separation Choosability and Dense Bipartite Induced Subgraphs ⋮ On choosability with separation of planar graphs with lists of different sizes

This page was built for publication: Brooks-type theorems for choosability with separation