Uniquely colorable mixed hypergraphs

DOI10.1016/S0012-365X(01)00176-5MaRDI QIDQ1598826zbMATH OpenFDO

Authors Zsolt Tuza, Huishan Zhou, V. I. Voloshin

Publication date 28 May 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(01)00176-5

zbMATH Keywords

algorithmic complexitycoloringlower (upper) chromatic numbermixed hypergraphunique colorability

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1439490
• Uncolorable mixed hypergraphs
• About some classes of mixed hypergraphs uniquely colorable with two colors
• Orderings of uniquely colorable hypergraphs
• About uniquely colorable mixed hypertrees

Cited in

(18)

• Color-bounded hypergraphs. I: General results
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• Pseudo-chordal mixed hypergraphs
• On the structure of uniform one-realizations of a given set
• Mixed hypercacti
• Uncolorable mixed hypergraphs
• Uniform mixed hypergraphs: the possible numbers of colors
• Coloring mixed hypertrees
• Circular mixed hypergraphs. II: The upper chromatic number
• Circular mixed hypergraphs. I: Colorability and unique colorability
• Circular and uniquely colorable mixed hypergraphs
• About some classes of mixed hypergraphs uniquely colorable with two colors
• Circular and uniquely colorable mixed hypergraphs
• The construction of a special type of weak uniquely colorable B-hypergraphs and the minimum vertex number
• About uniquely colorable mixed hypertrees
• scientific article; zbMATH DE number 1439490 (Why is no real title available?)
• Selective hypergraph colourings
• Orderings of uniquely colorable hypergraphs

This page was built for publication: Uniquely colorable mixed hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1598826)