Brooks-type theorems for choosability with separation

DOI10.1002/(SICI)1097-0118(199801)27:1%3C43::AID-JGT7%3E3.0.CO;2-GMaRDI QIDQ4376504zbMATH OpenOpenAlexFDO

Authors Jan Kratochvíl, Zsolt Tuza, Margit Voigt

Publication date 7 September 1998

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199801)27:1%3C43::aid-jgt7%3E3.0.co;2-g

zbMATH Keywords

computational complexitychoosabilitylist colouringvertex colouringBrooks theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• An extension of Thomassen's result on choosability
• Some Choquet theorems
• On a theorem of Choquet
• On a theorem of Choquet and Dolecki
• Some results on \((a:b)\)-choosability
• Brezis-Browder principles in general separable sets
• scientific article; zbMATH DE number 6374014
• A NOTE ON A CHOQUET-DENY-TYPE THEOREM
• Generalized separation theorems and the Farkas' lemma

Cited in

(21)

• List 4-colouring of planar graphs
• Single‐conflict colouring
• An extension of Thomassen's result on choosability
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
• Choosability with union separation of triangle-free planar graphs
• Separation choosability and dense bipartite induced subgraphs
• A note on not-4-list colorable planar graphs
• On choosability with separation of planar graphs without adjacent short cycles
• Coloring, sparseness and girth
• Choosability with union separation of planar graphs without cycles of length 4
• Brooks' theorem via the Alon-Tarsi theorem
• Choosability with separation of planar graphs without prescribed cycles
• On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\)
• A sufficient condition for planar graphs to be (3,1)-choosable
• Minimal abundant packings and choosability with separation
• Choosability with union separation
• On choosability with separation of planar graphs with forbidden cycles
• Choosability with separation of complete multipartite graphs and hypergraphs
• List dynamic 4-coloring of planar graphs
• On choosability with separation of planar graphs with lists of different sizes
• \((4,2)\)-choosability of planar graphs with forbidden structures

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

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