Colorings of hypergraphs
From MaRDI portal
This paper is a survey on hypergraph colouring. It defines different notions of hypergraph colouring (weak, strong, uniform, total, etc.) and gives an exhaustive list of results. The following topics are studied: basic properties, critical hypergraphs, bicolourings, extremal problems, edge-colourings, and other colourings. A useful feature of the paper is the extensive bibliography.
Recommendations
Cited in
(44)- Colorings of b-simple hypergraphs
- Strong total chromatic numbers of complete hypergraphs
- Zero-free intervals of chromatic polynomials of hypergraphs
- Coloring hypergraphs of low connectivity
- Chain method for panchromatic colorings of hypergraphs
- Concepts on coloring of cluster hypergraphs with application
- Generalized hypergraph coloring
- Coloring hypergraphs with bounded cardinalities of edge intersections
- DP-colorings of hypergraphs
- Good and nice colorings of balanced hypergraphs
- Hypergraph colouring
- Strong colourings of hypergraphs
- Hypergraph Coloring Games and Voter Models
- Nested colourings of graphs
- New challenges in the theory of hypergraph coloring
- On proper colourings of hypergraphs using prescribed colours
- scientific article; zbMATH DE number 3887739 (Why is no real title available?)
- On Some Extremal Properties of Hypergraph Colorings
- scientific article; zbMATH DE number 5763169 (Why is no real title available?)
- scientific article; zbMATH DE number 5177332 (Why is no real title available?)
- scientific article; zbMATH DE number 3922703 (Why is no real title available?)
- ON HYPERGRAPH COLOURINGS
- scientific article; zbMATH DE number 4055639 (Why is no real title available?)
- scientific article; zbMATH DE number 4075088 (Why is no real title available?)
- Hom complexes and hypergraph colorings
- scientific article; zbMATH DE number 15373 (Why is no real title available?)
- scientific article; zbMATH DE number 15467 (Why is no real title available?)
- scientific article; zbMATH DE number 25263 (Why is no real title available?)
- scientific article; zbMATH DE number 637278 (Why is no real title available?)
- scientific article; zbMATH DE number 863476 (Why is no real title available?)
- Hypergraph Coloring Games and Voter Models
- New strong colouring of hypergraphs
- From NMNR-coloring of hypergraphs to homogenous coloring of graphs
- scientific article; zbMATH DE number 6786475 (Why is no real title available?)
- scientific article; zbMATH DE number 5202627 (Why is no real title available?)
- scientific article; zbMATH DE number 5263063 (Why is no real title available?)
- Color-critical graphs and hypergraphs with few edges: a survey
- scientific article; zbMATH DE number 6605085 (Why is no real title available?)
- scientific article; zbMATH DE number 7663615 (Why is no real title available?)
- An algebraic formulation of hypergraph colorings
- Colorings of hypermaps and a conjecture of Brenner and Lyndon
- Cost colourings of hypergraphs
- Selective hypergraph colourings
- Vertex coloring acyclic digraphs and their corresponding hypergraphs
This page was built for publication: Colorings of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2767358)
