Pages that link to "Item:Q1896647"
From MaRDI portal
The following pages link to A contribution to the chromatic theory of uniform hypergraphs (Q1896647):
Displaying 18 items.
- Dense uniform hypergraphs have high list chromatic number (Q432708) (← links)
- Colorful subhypergraphs in uniform hypergraphs (Q510336) (← links)
- Chromatic Ramsey number of acyclic hypergraphs (Q729769) (← links)
- Uniform coloring of graph (Q744551) (← links)
- Some properties of chromatic coefficients of linear uniform hypergraphs (Q844223) (← links)
- Hypergraphs with high chromatic number (Q1086588) (← links)
- Chromatic coefficients of linear uniform hypergraphs (Q1272479) (← links)
- An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three (Q1306277) (← links)
- Bounds to the chromatic polynomial of a graph (Q1384128) (← links)
- About the upper chromatic number of a co-hypergraph (Q1567608) (← links)
- Chromatic capacities of graphs and hypergraphs (Q1827711) (← links)
- Chromatic numbers of algebraic hypergraphs (Q1990885) (← links)
- Zero-free intervals of chromatic polynomials of hypergraphs (Q2005730) (← links)
- The existence of uniform hypergraphs for which the interpolation property of complete coloring fails (Q2065902) (← links)
- Coloring \(d\)-embeddable \(k\)-uniform hypergraphs (Q2514227) (← links)
- ON HYPERGRAPH COLOURINGS (Q3728019) (← links)
- Chromatic polynomials of hypergraphs (Q5920448) (← links)
- On the degree, size, and chromatic index of a uniform hypergraph (Q5961544) (← links)