Uncolorable mixed hypergraphs

DOI10.1016/S0166-218X(99)00134-1zbMath0943.05035MaRDI QIDQ1962044

Zsolt Tuza, Vitaly I. Voloshin

Publication date: 5 September 2000

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

zbMATH Keywords

chromatic numbercoloringmixed hypergraph

Mathematics Subject Classification ID

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

Related Items (12)

On perfection and imperfection of one-realizations of a given set ⋮ Unnamed Item ⋮ Color-bounded hypergraphs. VI: Structural and functional jumps in complexity ⋮ Colorability of mixed hypergraphs and their chromatic inversions ⋮ Uniform mixed hypergraphs: the possible numbers of colors ⋮ Color-bounded hypergraphs, IV: Stable colorings of hypertrees ⋮ A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2 ⋮ Coloring mixed hypertrees ⋮ Circular mixed hypergraphs. II: The upper chromatic number ⋮ Complete colourings of hypergraphs ⋮ Orderings of uniquely colorable hypergraphs ⋮ Color-bounded hypergraphs. I: General results

Cites Work

• Graph coloring in linear time
• Precoloring extension. I: Interval graphs
• Mixed interval hypergraphs
• Upper chromatic number of Steiner triple and quadruple systems
• Strict colouring for classes of Steiner triple systems
• Graph colorings with local constraints -- a survey
• On chromatic number of graphs and set-systems
• Nombre chromatique et plus longs chemins d'un graphe
• An inequality for the chromatic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Uncolorable mixed hypergraphs