Uniquely colorable mixed hypergraphs

DOI10.1016/S0012-365X(01)00176-5zbMath0990.05044MaRDI QIDQ1598826

Zsolt Tuza, Hui Shan Zhou, Vitaly I. Voloshin

Publication date: 28 May 2002

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

zbMATH Keywords

algorithmic complexitycoloringmixed hypergraphunique colorabilitylower (upper) chromatic number

Mathematics Subject Classification ID

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

Related Items (10)

Mixed hypercacti ⋮ Unnamed Item ⋮ Selective hypergraph colourings ⋮ On the structure of uniform one-realizations of a given set ⋮ Coloring mixed hypertrees ⋮ Circular mixed hypergraphs. II: The upper chromatic number ⋮ Orderings of uniquely colorable hypergraphs ⋮ Color-bounded hypergraphs. I: General results ⋮ Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees ⋮ Pseudo-chordal mixed hypergraphs

This page was built for publication: Uniquely colorable mixed hypergraphs