scientific article; zbMATH DE number 2204176

MaRDI QIDQ5315865zbMATH OpenFDO

Authors Ewa Drgas-Burchardt

Publication date 12 September 2005

Mathematics Subject Classification ID

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

Recommendations

• List coloring hypergraphs
• Near-optimal list colorings
• Colorings versus list colorings of uniform hypergraphs
• List-colourings of graphs
• On the problem of Erdős and Hajnal in the case of list colorings

Cited in

(7)

• A Hajós-like theorem for list coloring
• List coloring hypergraphs
• Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
• List coloring triangle-free hypergraphs
• Generalized s-distance colourings of a hypergraph
• Colorings versus list colorings of uniform hypergraphs
• A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs

This page was built for publication:

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