Pages that link to "Item:Q1306277"
From MaRDI portal
The following pages link to An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three (Q1306277):
Displaying 6 items.
- On 3-uniform hypergraphs without a cycle of a given length (Q516784) (← links)
- A contribution to the chromatic theory of uniform hypergraphs (Q1896647) (← links)
- Zero-free intervals of chromatic polynomials of hypergraphs (Q2005730) (← links)
- 3-uniform hypergraphs without a cycle of length five (Q2182003) (← links)
- A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2 (Q2488941) (← links)
- ON HYPERGRAPH COLOURINGS (Q3728019) (← links)