Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,920,997 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
25 relations
Acyclic coloring
Biconnected component
Circular coloring
Connectivity (graph theory)
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Oriented Incidence Colourings of Digraphs
Christopher Duffy
,
G. MacGillivray
,
Pascal Ochem
,
A. Raspaud
Discussiones Mathematicae Graph Theory
2019
Corpus ID: 53240895
Abstract Brualdi and Quinn Massey [6] defined incidence colouring while study- ing the strong edge chromatic index of bipartite…
Expand
2018
2018
On Incidence Coloring of Complete Multipartite and Semicubic Bipartite Graphs
R. Janczewski
,
A. Malafiejska
,
M. Malafiejski
Discussiones Mathematicae Graph Theory
2018
Corpus ID: 207535269
Abstract In the paper, we show that the incidence chromatic number χi of a complete k-partite graph is at most Δ + 2 (i.e…
Expand
2017
2017
Interval Incidence Coloring of Subcubic Graphs
A. Malafiejska
,
M. Malafiejski
Discussiones Mathematicae Graph Theory
2017
Corpus ID: 85605
Abstract In this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that…
Expand
2015
2015
The incidence game chromatic number of (a, d)-decomposable graphs
C. Charpentier
,
É. Sopena
J. Discrete Algorithms
2015
Corpus ID: 1102795
2011
2011
The incidence game chromatic number of paths and subgraphs of wheels
John Y. Kim
Discrete Applied Mathematics
2011
Corpus ID: 36585187
2006
2006
NP-completeness of 4-incidence colorability of semi-cubic graphs
Xueliang Li
,
J. Tu
Discrete Mathematics
2006
Corpus ID: 59464
2006
2006
The incidence game chromatic number
S. Andres
Discrete Applied Mathematics
2006
Corpus ID: 13746118
2004
2004
Algorithm for Graph Incidence Coloring Base on Hybrid Genetic Algorithm
Liu Xi-kui
,
Li Yan
2004
Corpus ID: 124889744
The problem coloring on a graph is a NP-hard problem. We presents a genetic algorithm for the incidence coloring on graphs…
Expand
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…
Expand
2001
2001
The Incidence Coloring Number of Complete k-Partite Graph
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…
Expand
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)
ACCEPT & CONTINUE