Hypergraph colouring
From MaRDI portal
Recommendations
Cited in
(40)- On the structure of uniform one-realizations of a given set
- Applications of hypergraph coloring to coloring graphs not inducing certain trees
- On proper colorings of hypergraphs
- Coloring hypergraphs of low connectivity
- Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra
- Chain method for panchromatic colorings of hypergraphs
- Concepts on coloring of cluster hypergraphs with application
- Coloring hypergraphs with bounded cardinalities of edge intersections
- A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
- Pattern hypergraphs
- \(F\)-WORM colorings: results for 2-connected graphs
- DP-colorings of hypergraphs
- Reducing hypergraph coloring to clique search
- The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
- Colorings of hypergraphs
- Hypergraph Coloring Games and Voter Models
- 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?)
- scientific article; zbMATH DE number 5763169 (Why is no real title available?)
- Color-bounded hypergraphs, III: model comparison
- scientific article; zbMATH DE number 4055639 (Why is no real title available?)
- scientific article; zbMATH DE number 4075088 (Why is no real title available?)
- Problems on cycles and colorings
- scientific article; zbMATH DE number 15467 (Why is no real title available?)
- scientific article; zbMATH DE number 25263 (Why is no real title available?)
- Hypergraph coloring and reconfigured RAM testing
- Acceptable colorings of indexed hyperspaces
- Block colourings of 6-cycle systems
- Hypergraph Coloring Games and Voter Models
- scientific article; zbMATH DE number 6786475 (Why is no real title available?)
- scientific article; zbMATH DE number 5202627 (Why is no real title available?)
- Graph and hypergraph colouring via nibble methods: a survey
- Coloring directed hypergraphs
- An algebraic formulation of hypergraph colorings
- On the upper chromatic number and multiple blocking sets of PG(n,q)
- Hopf algebraic structures on hypergraphs and multi-complexes
- Cost colourings of hypergraphs
- Selective hypergraph colourings
- Color-bounded hypergraphs, IV: Stable colorings of hypertrees
This page was built for publication: Hypergraph colouring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822598)
