Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs

DOI10.1016/J.DISC.2013.11.016zbMath1281.05061arXiv1307.6642OpenAlexW2010412261MaRDI QIDQ394316

Josef Lauri, Yair Caro

Publication date: 27 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.6642

zbMATH Keywords

mixed hypergraphscolouringsmonochromatic edgesrainbow edges

Mathematics Subject Classification ID

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

Related Items (5)

Vertex colorings without rainbow subgraphs ⋮ Selective hypergraph colourings ⋮ More results on the smallest one-realization of a given set. II ⋮ Constrained colouring and \(\sigma\)-hypergraphs ⋮ \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Color-bounded hypergraphs. I: General results
• Bicoloring Steiner triple systems
• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
• Voloshin's colourings of \(P_{3}\)-designs
• On the upper chromatic index of a multigraph
• Colouring planar mixed hypergraphs
• The chromatic spectrum of mixed hypergraphs
• Coloring mixed hypergraphs: theory, algorithms and applications
• On feasible sets of mixed hypergraphs
• Colorability of mixed hypergraphs and their chromatic inversions
• Pattern hypergraphs
• On the price of equivocation in byzantine agreement
• On planar mixed hypergraphs

This page was built for publication: Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs