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… 
2011
2011
  • John Y. Kim
  • Discrete Applied Mathematics
  • 2011
  • Corpus ID: 36585187
2006
2006
  • S. Andres
  • Discrete Applied Mathematics
  • 2006
  • Corpus ID: 13746118
2004
2004
The problem coloring on a graph is a NP-hard problem. We presents a genetic algorithm for the incidence coloring on graphs… 
2001
2001
  • Liu Xi
  • 2001
  • Corpus ID: 123447126
For some corona graphs, it is proved that the ICC conjecture is true which indicates that every graph G can be incidence colored… 
2001
2001
  • Liu Xi
  • 2001
  • Corpus ID: 123877823
The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey. They conjectured that every graph…