Selective hypergraph colourings
From MaRDI portal
Publication:906467
DOI10.1016/j.disc.2015.11.006zbMath1329.05219arXiv1504.04112OpenAlexW338661506MaRDI QIDQ906467
Christina Zarb, Yair Caro, Josef Lauri
Publication date: 21 January 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.04112
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs
- Color-bounded hypergraphs. I: General results
- Uniquely colorable mixed hypergraphs
- The chromatic spectrum of mixed hypergraphs
- Coloring mixed hypergraphs: theory, algorithms and applications
- Constrained colouring and \(\sigma\)-hypergraphs
- \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs
- On the construction of 3-chromatic hypergraphs with few edges
- Pattern hypergraphs
- On some colouring of 4-cycle systems with specified block colour patterns
- Constructions of sparse uniform hypergraphs with high chromatic number
- Conflict-Free Colourings of Graphs and Hypergraphs
- Handbook of Graph Theory
- Conflict-Free Coloring and its Applications
- Colouring \(4\)-cycle systems with specified block colour patterns: The case of embedding \(P_3\)-designs
- Colouring Steiner systems with specified block colour patterns
This page was built for publication: Selective hypergraph colourings
