Incidence and strong edge colorings of graphs
type: Item
instance of: scholarly article
title: Incidence and strong edge colorings of graphs
zbMATH Open document ID: 0790.05026
DOI: 10.1016/0012-365X(93)90286-3
author: Richard A. Brualdi
author: Jennifer J. Quinn
published in: Discrete Mathematics
publication date: 1994-06-22T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 500628
zbMATH Keywords: strong edge colorings
zbMATH Keywords: incidence coloring number
zbMATH Keywords: strong chromatic index
zbMATH Keywords: bipartite graph
reviewed by: Martin Loebl
MaRDI profile type: Publication
cites work: The strong chromatic index of a cubic graph is at most 10
cites work: Induced matchings in bipartite graphs
cites work: Q5752590
cites work: Q3853641
cites work: Induced matchings in cubic graphs
cites work: A hierarchy of totally unimodular matrices
cites work: On a Class of Totally Unimodular Matrices
full work available at URL: 0012-365x(93)90286-3
OpenAlex ID: W1993409199
Wikidata QID: Q130465593
description: scientific article; zbMATH DE number 500628