The incidence chromatic number of some graph (Q2570955): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q21284479, #quickstatements; #temporary_batch_1711234560214 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q21284479 / rank | |||
Normal rank | |||
Latest revision as of 01:47, 24 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The incidence chromatic number of some graph |
scientific article |
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
