Equitable colorings of nonuniform hypergraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- scientific article; zbMATH DE number 3188524 (Why is no real title available?)
- Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
- Color-critical graphs and hypergraphs with few edges: a survey
- Coloring non-uniform hypergraphs without short cycles
- Equitable two-colorings of uniform hypergraphs
- On 3-chromatic hypergraphs
- On a combinatorial problem. II
- On a property of families of sets
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- Using Lovász local lemma in the space of random injections
Cited in
(14)- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
- Equitable colorings of hypergraphs with \(r\) colors
- Extremal problems in hypergraph colourings
- A hyperedge coloring and application in combinatorial testing
- On equitable colorings of hypergraphs
- Equitable Coloring ofk-Uniform Hypergraphs
- Equitable orientations of sparse uniform hypergraphs
- On almost-regular edge colourings of hypergraphs
- scientific article; zbMATH DE number 2246595 (Why is no real title available?)
- Equitable coloring of hypergraphs
- Equitable colorings of hypergraphs with few edges
- Equitable colorings of non-uniform simple hypergraphs
- Equitable two-colorings of uniform hypergraphs
- Equitable hypergraph orientations
This page was built for publication: Equitable colorings of nonuniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325641)
