Conflict-Free Colourings of Uniform Hypergraphs With Few Edges
From MaRDI portal
Publication:2908131
DOI10.1017/S0963548312000156zbMath1247.05082MaRDI QIDQ2908131
Tomasz Łuczak, Mohit Kumbhat, Alexandr V. Kostochka
Publication date: 4 September 2012
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Related Items (11)
On Conflict-Free Multi-coloring ⋮ Colorings with neighborhood parity condition ⋮ 1-planar graphs are odd 13-colorable ⋮ On conflict-free proper colourings of graphs without small degree vertices ⋮ Conflict‐free chromatic number versus conflict‐free chromatic index ⋮ A note on the conflict-free chromatic index ⋮ Defective coloring of hypergraphs ⋮ Unique-maximum coloring of plane graphs ⋮ Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs ⋮ 2-colorability of \(r\)-uniform hypergraphs ⋮ Remarks on proper conflict-free colorings of graphs
Cites Work
- Hypergraphs with high chromatic number
- On 3-chromatic hypergraphs
- Coloring n-sets red and blue
- Conflict-free coloring of points and simple regions in the plane
- Conflict-Free Colourings of Graphs and Hypergraphs
- Bombieri's theorem in short intervals
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Improved bounds and algorithms for hypergraph 2-coloring
- Deterministic conflict-free coloring for intervals
- Online Conflict‐Free Coloring for Intervals
- Online Conflict-Free Colorings for Hypergraphs
This page was built for publication: Conflict-Free Colourings of Uniform Hypergraphs With Few Edges
