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)

Related topics

Related topics

25 relations
Acyclic coloringBiconnected componentCircular coloringConnectivity (graph theory)

Broader (1)

Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Oriented Incidence Colourings of Digraphs
Abstract Brualdi and Quinn Massey [6] defined incidence colouring while study- ing the strong edge chromatic index of bipartite… 
2018
2018
On Incidence Coloring of Complete Multipartite and Semicubic Bipartite Graphs
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
Interval Incidence Coloring of Subcubic Graphs
Abstract In this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that… 
2015
2015
The incidence game chromatic number of (a, d)-decomposable graphs
2014
2014
On the incidence coloring number of folded hypercubes
Let <sub>Xi</sub>(G) denote the incidence coloring number of a graph G. An easy observation shows that <sub>Xi</sub>(G) ≥ Δ(G… 
2012
2012
Some results on incidence coloring, star arboricity and domination number
Two inequalities bridging the three isolated graph invariants, incidence chromatic number, star arboricity and domination number… 
2006
2006
The incidence game chromatic number
2005
2005
The incidence chromatic number of some graph
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
Algorithm for Graph Incidence Coloring Base on Hybrid Genetic Algorithm
The problem coloring on a graph is a NP-hard problem. We presents a genetic algorithm for the incidence coloring on graphs… 
2001
2001
The Incidence Coloring of Corona Graph
  • 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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)