Constrained colouring and \(\sigma\)-hypergraphs
From MaRDI portal
Publication:2259578
DOI10.7151/dmgt.1789zbMath1307.05065arXiv1401.1920OpenAlexW2073860299MaRDI QIDQ2259578
Josef Lauri, Christina Zarb, Yair Caro
Publication date: 4 March 2015
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.1920
Related Items (2)
Cites Work
- Unnamed Item
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
- Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs
- Color-bounded hypergraphs, IV: Stable colorings of hypertrees
- Color-bounded hypergraphs. I: General results
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
- Voloshin's colourings of \(P_{3}\)-designs
- The chromatic spectrum of mixed hypergraphs
- Coloring mixed hypergraphs: theory, algorithms and applications
- Colorability of mixed hypergraphs and their chromatic inversions
- Pattern hypergraphs
- On the price of equivocation in byzantine agreement
- Color-bounded hypergraphs, V: host graphs and subdivisions
This page was built for publication: Constrained colouring and \(\sigma\)-hypergraphs