Colorings versus list colorings of uniform hypergraphs

DOI10.1002/JGT.22550zbMATH Open1486.05106OpenAlexW3005625135MaRDI QIDQ5066928FDOQ5066928

Authors: Wei Wang, Zhidan Yan, Jianguo Qian 

Publication date: 31 March 2022

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

Full work available at URL: https://doi.org/10.1002/jgt.22550

Recommendations

• Coloring uniform hypergraphs with few colors
• List coloring hypergraphs
• Near-optimal list colorings
• scientific article; zbMATH DE number 2204176
• The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets

zbMATH Keywords

list coloringchromatic polynomialuniform hypergraphbroken cycle

Mathematics Subject Classification ID

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

Cited In (10)

• Title not available (Why is that?)
• Hypergraph list coloring and Euclidean Ramsey theory
• Choosability in simple hypergraphs
• Hypergraph extension of the Alon-Tarsi list coloring theorem
• Dense uniform hypergraphs have high list chromatic number
• Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II
• A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
• When does the list-coloring function of a graph equal its chromatic polynomial
• The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets
• List coloring hypergraphs

This page was built for publication: Colorings versus list colorings of uniform hypergraphs

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