Uncolorable mixed hypergraphs
From MaRDI portal
Publication:1962044
Recommendations
Cites work
- scientific article; zbMATH DE number 3874089 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 3480514 (Why is no real title available?)
- scientific article; zbMATH DE number 786134 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 3257176 (Why is no real title available?)
- An inequality for the chromatic number of a graph
- Graph coloring in linear time
- Graph colorings with local constraints -- a survey
- Mixed interval hypergraphs
- Nombre chromatique et plus longs chemins d'un graphe
- On chromatic number of graphs and set-systems
- Precoloring extension. I: Interval graphs
- Strict colouring for classes of Steiner triple systems
- Upper chromatic number of Steiner triple and quadruple systems
Cited in
(20)- Integer programming models for colorings of mixed hypergraphs
- A necessary and sufficient condition of \({\mathcal D}\)-complete uniform mixed hypergraphs being uncolorable
- Circular mixed hypergraphs. II: The upper chromatic number
- Circular and uniquely colorable mixed hypergraphs
- On the upper chromatic number of (v₃,b₂)-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
- Circular and uniquely colorable mixed 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
- scientific article; zbMATH DE number 1834670 (Why is no real title available?)
- 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)
