Colorability of mixed hypergraphs and their chromatic inversions

DOI10.1007/s10878-012-9559-7zbMath1271.05070OpenAlexW2031033190MaRDI QIDQ1956247

Zsolt Tuza, Máté Hegyháti

Publication date: 13 June 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9559-7

zbMATH Keywords

algorithmic complexitymixed hypergraphhypergraph coloringchromatic inversion

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs ⋮ Constrained colouring and \(\sigma\)-hypergraphs

Cites Work

• On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
• The chromatic spectrum of mixed hypergraphs
• Uncolorable mixed hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Colorability of mixed hypergraphs and their chromatic inversions