Polychromatic colorings and cover decompositions of hypergraphs

DOI10.1016/j.amc.2018.07.019zbMath1428.05112OpenAlexW2887974077MaRDI QIDQ2007510

Xia Zhang, Ting-Ting Li

Publication date: 22 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.07.019

zbMATH Keywords

hypergraphcover decompositionpolychromatic coloringproperty \(B\)

Mathematics Subject Classification ID

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

Related Items (3)

Polychromatic colorings of hypergraphs with high balance ⋮ Concepts on coloring of cluster hypergraphs with application ⋮ Coloring Delaunay-edges and their generalizations

Cites Work

• Unnamed Item
• Unnamed Item
• Coloring and the Lovász local lemma
• ``Integer-making theorems
• On 2-coloring certain \(k\)-uniform hypergraphs
• Every 8-uniform 8-regular hypergraph is 2-colorable
• 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
• Cover-Decomposition and Polychromatic Numbers

This page was built for publication: Polychromatic colorings and cover decompositions of hypergraphs