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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2012

Two inequalities bridging the three isolated graph invariants, incidence chromatic number, star arboricity and domination number…

2011

The concept of d-distance vertex-distinguishing incidence coloring is developed,and some d-distance vertex-distinguishing…

2009

In recent years,the research of graph coloring theory has obtained many valuable results.At the same time,a lot of new coloring…

2008

An incidence of G consists of a vertex and one of its incident edge in G. The incidence coloring problem is a variation of vertex…

2005

In 1993,Brualdi and Massey conjectured that every graphGcan be incidence colored withΔ(G)+2colors.Although this conjecture was…

2004

The problem coloring on a graph is a NP-hard problem. We presents a genetic algorithm for the incidence coloring on graphs…

2001

For some corona graphs, it is proved that the ICC conjecture is true which indicates that every graph G can be incidence colored…

2001

The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey. They conjectured that every graph…

1999

Richard A.Brualdi and J.Quinn Massey introduced the incidence coloring number in [1], and gave its conjecture, i.e. every graph G…