On Incidence Coloring of Complete Multipartite and Semicubic Bipartite Graphs
In the paper, we show that the incidence chromatic number χi of a complete k-partite graph is at most Δ + 2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to Δ + 1 if and only if the smallest part has only one vertex (i.e., Δ = n − 1). Formally, for a complete k-p...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2018-02-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | http://www.degruyter.com/view/j/dmgt.2018.38.issue-1/dmgt.1995/dmgt.1995.xml?format=INT |