An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three (Q1306277): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:38, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three |
scientific article |
Statements
An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three (English)
0 references
4 October 1999
0 references
colouring
0 references
bound
0 references
chromatic number
0 references
uniform hypergraph
0 references
cycles
0 references
chromatic polynomial
0 references
