INCIDENCE AND STRONG EDGE COLORINGS OF GRAPHS

Authors
BRUALDI RA MASSEY JJQ
Citation
Ra. Brualdi et Jjq. Massey, INCIDENCE AND STRONG EDGE COLORINGS OF GRAPHS, Discrete mathematics, 122(1-3), 1993, pp. 51-58
Citations number
8
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Discrete mathematics → ACNP
ISSN journal
0012365X
Volume
122
Issue
1-3
Year of publication
1993
Pages
51 - 58
Database
ISI
SICI code
0012-365X(1993)122:1-3<51:IASECO>2.0.ZU;2-1
Abstract
We define the incidence coloring number of a graph and bound it in ter ms of the maximum degree. The incidence coloring number turns out to b e the strong chromatic index of an associated bipartite graph. We impr ove a bound for the strong chromatic index of bipartite graphs all of whose cycle lengths are divisible by 4.