Choosability with Separation of Complete Multipartite Graphs and Hypergraphs

DOI10.1002/jgt.21754zbMath1291.05063arXiv1109.2969OpenAlexW2591668636MaRDI QIDQ5418773

Mohit Kumbhat, Zoltan Fueredi, Alexandr V. Kostochka

Publication date: 28 May 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.2969

zbMATH Keywords

hypergraphsseparationlist coloringmultipartite graphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Coloring, sparseness and girth ⋮ A sufficient condition for planar graphs to be (3,1)-choosable ⋮ Single‐conflict colouring ⋮ Choosability with union separation ⋮ List 4-colouring of 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

Cites Work

• On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
• On the ratio of optimal integral and fractional covers
• Choice Numbers of Graphs: a Probabilistic Approach
• Brooks-type theorems for choosability with separation
• On the asymptotic value of the choice number of complete multi‐partite graphs
• On a combinatorial problem. II

This page was built for publication: Choosability with Separation of Complete Multipartite Graphs and Hypergraphs