scientific article; zbMATH DE number 5825874
From MaRDI portal
Publication:3060863
Recommendations
- Coloring uniform hypergraphs with few edges
- Coloring uniform hypergraphs with few colors
- Edge coloring of graphs with small maximum degrees
- Edge coloring of graphs with small average degrees
- Edge coloring complete uniform hypergraphs with many components
- Approximate coloring of uniform hypergraphs
- Conflict-free colourings of uniform hypergraphs with few edges
- Strong edge colorings of uniform graphs
- Harmonious coloring of uniform hypergraphs
Cited in
(14)- On proper colorings of hypergraphs
- Every 8-uniform 8-regular hypergraph is 2-colorable
- A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs
- Colorings of partial Steiner systems and their applications
- Coloring sparse hypergraphs
- Constructions of sparse uniform hypergraphs with high chromatic number
- Coloring uniform hypergraphs with few colors
- Degrees in oriented hypergraphs and Ramsey p-chromatic number
- Colourings of uniform hypergraphs with large girth and applications
- Subdivision of hypergraphs and their colorings
- Extremal problems in hypergraph colourings
- Harmonious coloring of uniform hypergraphs
- Defective coloring of hypergraphs
- On r-chromatic hypergraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060863)
