Strong colorings of hypergraphs
From MaRDI portal
Recommendations
- Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
- On the strong chromatic number of random hypergraphs
- scientific article; zbMATH DE number 4055639
- Approximate hypergraph coloring
- Strong inapproximability results on balanced rainbow-colorable hypergraphs
Cited in
(22)- Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
- Flexible coloring
- On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs
- Zero-free intervals of chromatic polynomials of hypergraphs
- Relating hypergraph parameters of generalized power graphs
- Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra
- Concepts on coloring of cluster hypergraphs with application
- Complete colourings of hypergraphs
- Strong colourings of hypergraphs
- The complexity of vertex coloring problems in uniform hypergraphs with high degree
- scientific article; zbMATH DE number 6096637 (Why is no real title available?)
- scientific article; zbMATH DE number 5123534 (Why is no real title available?)
- Random hypergraph coloring algorithms and the weak chromatic number
- scientific article; zbMATH DE number 4055639 (Why is no real title available?)
- Strongly set-colorable graphs
- Strong k-colourings of graphs
- STRONG COLORINGS OVER PARTITIONS
- Subdivision of hypergraphs and their colorings
- New strong colouring of hypergraphs
- Semi-strong colouring of intersecting hypergraphs
- On optimal achromatic coloring of 3-uniform tight cycles
- Asymptotic probabilities of extension properties and random l-colourable structures
This page was built for publication: Strong colorings of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713442)