The incidence chromatic number of high degree graphs (Q2764455)
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: The incidence chromatic number of high degree graphs |
scientific article; zbMATH DE number 1690436
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The incidence chromatic number of high degree graphs |
scientific article; zbMATH DE number 1690436 |
Statements
14 January 2002
0 references
chromatic number
0 references
incidence chromatic number
0 references
edge colouring
0 references
The incidence chromatic number of high degree graphs (English)
0 references
The authors consider the graphs \(G\) with maximum vertex degree \(\Delta(G)= n-2\), where \(n\) is the order of \(G\). They characterize the graphs which have incidence chromatic number \(\Delta(G)+ 1\) or \(\Delta(G)+ 2\), respectively. The notion of incidence chromatic number was introduced in effort to solve the conjecture of stronge edge colouring.
0 references
