Back to Search
Start Over
Incidence Coloring—Cold Cases
- Source :
- Discussiones Mathematicae Graph Theory, Vol 40, Iss 1, Pp 345-354 (2020)
- Publication Year :
- 2020
- Publisher :
- University of Zielona Góra, 2020.
-
Abstract
- An incidence in a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident to v. Two incidences (v, e) and (u, f) are adjacent if at least one of the following holds: (i) v = u, (ii) e = f, or (iii) edge vu is from the set {e, f}. An incidence coloring of G is a coloring of its incidences assigning distinct colors to adjacent incidences. The minimum number of colors needed for incidence coloring of a graph is called the incidence chromatic number.
Details
- Language :
- English
- ISSN :
- 20835892
- Volume :
- 40
- Issue :
- 1
- Database :
- Directory of Open Access Journals
- Journal :
- Discussiones Mathematicae Graph Theory
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.1d52f41d2de41e486f04a6a2dcb371d
- Document Type :
- article
- Full Text :
- https://doi.org/10.7151/dmgt.2140