An upper bound for the total chromatic number of dense graphs (Q4013421): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190160302 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000581481 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198785 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:10, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the total chromatic number of dense graphs |
scientific article |
Statements
An upper bound for the total chromatic number of dense graphs (English)
0 references
27 September 1992
0 references
upper bound
0 references
dense graphs
0 references
total chromatic number
0 references
