Colorings of b-simple hypergraphs
From MaRDI portal
Colorings of \(b\)-simple hypergraphs
Recommendations
- Colorings of hypergraphs
- \(b\)-coloring of some bipartite graphs
- On \(b\)-colorings in regular graphs
- ON HYPERGRAPH COLOURINGS
- Coloring bipartite hypergraphs
- scientific article; zbMATH DE number 5717278
- scientific article; zbMATH DE number 5202627
- Some results on the \(b\)-colouring parameters of graphs
- b-coloring of Kneser graphs
- b-coloring of some powers of hypercubes
Cites work
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- A note on random greedy coloring of uniform hypergraphs
- An application of Lovász' local lemma-A new lower bound for the van der Waerden number
- Coloring uniform hypergraphs with few edges
- Colorings of hypergraphs with large number of colors
- Constructions of sparse uniform hypergraphs with high chromatic number
- Greedy colorings of uniform hypergraphs
- Improved algorithms for colorings of simple hypergraphs and applications
- Improved bounds and algorithms for hypergraph 2-coloring
- Multipass greedy coloring of simple uniform hypergraphs
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
Cited in
(8)- Panchromatic 3-colorings of random hypergraphs
- Extremal problems in hypergraph colourings
- Extremal problems for colorings of simple hypergraphs and applications
- On \(b\)-coloring of powers of hypercubes
- Equitable colorings of hypergraphs with few edges
- Coloring uniform hypergraphs with few edges
- The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets
- Equitable colorings of hypergraphs with \(r\) colors
This page was built for publication: Colorings of \(b\)-simple hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689874)
