Incidence and strong edge colorings of graphs (Q1313849): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q185366 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Martin Loebl / rank | |||
Normal rank | |||
Revision as of 19:37, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Incidence and strong edge colorings of graphs |
scientific article |
Statements
Incidence and strong edge colorings of graphs (English)
0 references
22 June 1994
0 references
The incidence coloring number of a graph is defined and bounded in terms of the maximum degree. The incidence coloring number turns out to be the strong chromatic index of an associated bipartite graph. A bound for the strong chromatic index of bipartite graphs all of whose cycle lengths are divisible by 4 is improved.
0 references
strong edge colorings
0 references
incidence coloring number
0 references
strong chromatic index
0 references
bipartite graph
0 references
