Total Chromatic Number of Graphs of Order 2<i>n</i> + l having Maximum Degree 2<i>n</i> − 1 (Q4894516)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n − 1 |
scientific article; zbMATH DE number 932073
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Total Chromatic Number of Graphs of Order 2<i>n</i> + l having Maximum Degree 2<i>n</i> − 1 |
scientific article; zbMATH DE number 932073 |
Statements
Total Chromatic Number of Graphs of Order 2<i>n</i> + l having Maximum Degree 2<i>n</i> − 1 (English)
0 references
26 January 1997
0 references
total chromatic number
0 references
colour
0 references
TCC
0 references
maximum degree
0 references
classification
0 references
0.95445573
0 references
0.92707384
0 references
0.91195965
0 references
0.9080386
0 references
