Incidence and strong edge colorings of graphs (Q1313849)
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: Incidence and strong edge colorings of graphs |
scientific article; zbMATH DE number 500628
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Incidence and strong edge colorings of graphs |
scientific article; zbMATH DE number 500628 |
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
