Orderings of uniquely colorable hypergraphs

DOI10.1016/J.DAM.2007.02.008zbMath1121.05044DBLPjournals/dam/BujtasT07OpenAlexW2002277891WikidataQ59072744 ScholiaQ59072744MaRDI QIDQ997065

Zsolt Tuza, Csilla Bujtás

Publication date: 19 July 2007

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

Full work available at URL: https://doi.org/10.1016/j.dam.2007.02.008

zbMATH Keywords

Algorithmic complexityMixed hypergraphUniquely colourableVertex-order

Mathematics Subject Classification ID

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

Related Items (1)

Color-bounded hypergraphs. I: General results

Cites Work

• Uniquely colorable mixed hypergraphs
• Coloring mixed hypergraphs: theory, algorithms and applications
• Uncolorable mixed hypergraphs
• About uniquely colorable mixed hypertrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Orderings of uniquely colorable hypergraphs