Orderings of uniquely colorable hypergraphs

DOI10.1016/J.DAM.2007.02.008MaRDI QIDQ997065zbMATHOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

Algorithmic complexityMixed hypergraphUniquely colourableVertex-order

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3702545 (Why is no real title available?)
• scientific article; zbMATH DE number 3503283 (Why is no real title available?)
• scientific article; zbMATH DE number 1933047 (Why is no real title available?)
• scientific article; zbMATH DE number 786134 (Why is no real title available?)
• About uniquely colorable mixed hypertrees
• Coloring mixed hypergraphs: theory, algorithms and applications
• Uncolorable mixed hypergraphs
• Uniquely colorable mixed hypergraphs

Cited in

(5)

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

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)