The incidence chromatic number of some graph (Q2570955)
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 some graph |
scientific article; zbMATH DE number 2220829
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The incidence chromatic number of some graph |
scientific article; zbMATH DE number 2220829 |
Statements
The incidence chromatic number of some graph (English)
0 references
31 October 2005
0 references
Summary: The concept of the incidence chromatic number of a graph was introduced by \textit{R. A. Brualdi} and \textit{J. J. Q. Massey} [Discrete Math. 122, 51--58 (1993; Zbl 0790.05026)]. They conjectured that every graph \(G\) can be incidence colored with \(\Delta(G)+2\) colors. In this paper, we calculate the incidence chromatic numbers of the complete \(k\)-partite graphs and give the incidence chromatic number of three infinite families of graphs.
0 references
0.8493375182151794
0 references
0.8435357213020325
0 references
0.8339731097221375
0 references
0.8339731097221375
0 references
0.8301509022712708
0 references
