Uniquely colorable mixed hypergraphs
From MaRDI portal
Publication:1598826
DOI10.1016/S0012-365X(01)00176-5zbMath0990.05044MaRDI QIDQ1598826
Zsolt Tuza, Vitaly I. Voloshin, Hui Shan Zhou
Publication date: 28 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
algorithmic complexity; coloring; mixed hypergraph; unique colorability; lower (upper) chromatic number
Related Items
Orderings of uniquely colorable hypergraphs, Color-bounded hypergraphs. I: General results, Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees, Pseudo-chordal mixed hypergraphs, Mixed hypercacti, Coloring mixed hypertrees, Circular mixed hypergraphs. II: The upper chromatic number, Unnamed Item