Uncolorable mixed hypergraphs

DOI10.1016/S0166-218X(99)00134-1zbMATH Open0943.05035MaRDI QIDQ1962044FDOQ1962044

V. I. Voloshin, Zsolt Tuza

Publication date: 5 September 2000

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

Recommendations

• scientific article; zbMATH DE number 1439490
• Chromatic spectrum is broken
• Uniquely colorable mixed hypergraphs
• scientific article; zbMATH DE number 1834670
• scientific article

zbMATH Keywords

chromatic numbercoloringmixed hypergraph

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?)
• Graph colorings with local constraints -- a survey
• Title not available (Why is that?)
• Mixed interval hypergraphs
• Nombre chromatique et plus longs chemins d'un graphe
• On chromatic number of graphs and set-systems
• Title not available (Why is that?)
• Precoloring extension. I: Interval graphs
• Graph coloring in linear time
• Upper chromatic number of Steiner triple and quadruple systems
• Strict colouring for classes of Steiner triple systems
• An inequality for the chromatic number of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (18)

• Integer programming models for colorings of mixed hypergraphs
• Circular mixed hypergraphs. II: The upper chromatic number
• Circular and uniquely colorable mixed hypergraphs
• On the upper chromatic number of \((v_3,b_2)\)-configurations
• On perfection and imperfection of one-realizations of a given set
• Orderings of uniquely colorable hypergraphs
• Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
• Color-bounded hypergraphs, IV: Stable colorings of hypertrees
• Color-bounded hypergraphs. I: General results
• About some classes of mixed hypergraphs uniquely colorable with two colors
• Complete colourings of hypergraphs
• Colouring planar mixed hypergraphs
• Uniquely colorable mixed hypergraphs
• Colorability of mixed hypergraphs and their chromatic inversions
• Uniform mixed hypergraphs: the possible numbers of colors
• A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
• Title not available (Why is that?)
• Coloring mixed hypertrees

This page was built for publication: Uncolorable mixed hypergraphs

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