Equitable colorings of hypergraphs with r colors
From MaRDI portal
Publication:2671950
Recommendations
Cites work
- 2-colorings of uniform hypergraphs
- A note on panchromatic colorings
- A note on random greedy coloring of uniform hypergraphs
- Coloring uniform hypergraphs with few colors
- Colorings of b-simple hypergraphs
- Colorings of hypergraphs with large number of colors
- Equitable two-colorings of uniform hypergraphs
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- On a combinatorial problem. II
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
Cited in
(11)- On equitable colorings of hypergraphs
- Coloring hypergraphs with bounded cardinalities of edge intersections
- Equitable colorings of hypergraphs with few edges
- A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs
- Equitable coloring of hypergraphs
- Equitable colorings of non-uniform simple hypergraphs
- Equitable colorings of nonuniform hypergraphs
- scientific article; zbMATH DE number 1933047 (Why is no real title available?)
- Equitable Coloring ofk-Uniform Hypergraphs
- A hyperedge coloring and application in combinatorial testing
- Uniform coloring of graph
This page was built for publication: Equitable colorings of hypergraphs with \(r\) colors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2671950)