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 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A contribution to the chromatic theory of uniform hypergraphs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:28, 29 May 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
