Skip to search formSkip to main contentSkip to account menu

Incidence coloring

Known as: Incidence colouring 
In graph theory, coloring generally implies assignment of labels to vertices, edges or faces in a graph. The incidence coloring is a special graph… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Abstract Brualdi and Quinn Massey [6] defined incidence colouring while study- ing the strong edge chromatic index of bipartite… 
2018
2018
Abstract In the paper, we show that the incidence chromatic number χi of a complete k-partite graph is at most Δ + 2 (i.e… 
2017
2017
Abstract In this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that… 
2005
2005
Throughout the paper, all graphs dealt with are finite, simple, undirected, and loopless. Let G be a graph, and let V(G), E(G… 
2004
2004
The problem coloring on a graph is a NP-hard problem. We presents a genetic algorithm for the incidence coloring on graphs…