Orderings of uniquely colorable hypergraphs

DOI10.1016/J.DAM.2007.02.008zbMATH Open1121.05044DBLPjournals/dam/BujtasT07OpenAlexW2002277891WikidataQ59072744 ScholiaQ59072744MaRDI QIDQ997065FDOQ997065

Authors: Csilla Bujtás, Zsolt Tuza 

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

Recommendations

• Uniquely colorable mixed hypergraphs
• Circular mixed hypergraphs. I: Colorability and unique colorability
• scientific article; zbMATH DE number 1439490
• scientific article; zbMATH DE number 1834670
• Circular and uniquely colorable mixed hypergraphs

zbMATH Keywords

Algorithmic complexityMixed hypergraphUniquely colourableVertex-order

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Coloring mixed hypergraphs: theory, algorithms and applications
• Uncolorable mixed hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Uniquely colorable mixed hypergraphs
• About uniquely colorable mixed hypertrees

Cited In (5)

• Coloring Ordered Sets to Avoid Monochromatic Maximal Chains
• Color-bounded hypergraphs. I: General results
• Uniquely colorable mixed hypergraphs
• DOWNWARD UNARY COLORINGS
• Helly-type theorems for the ordering of the vertices of a hypergraph

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

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