Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Incidence coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Abstract An incidence of a graph G is a pair ( v , e ) with v ∈ V ( G ) , e ∈ E ( G ) , such that v and e are incident. Two… Expand
Is this relevant?
2009
2009
This paper proves that if G is a cubic graph which has a Hamiltonian path or G is a bridgeless cubic graph of large girth, then… Expand
Is this relevant?
2008
2008
Abstract An incidence coloring of graph G is a coloring of its incidences in which neighborly incidences are assigned different… Expand
Is this relevant?
2008
2008
Incidence coloring of a graph G is a mapping from the set of incidences to a color-set C such that adjacent incidences of G are… Expand
Is this relevant?
2005
2005
The incidence coloring conjecture, or ICC, states that any graph can be incidence-colored with @D+2 colors, where @D is the… Expand
Is this relevant?
2004
2004
Abstract We prove that the incidence coloring number of every k -degenerated graph G is at most Δ ( G )+2 k −1. For K 4 -minor… Expand
Is this relevant?
2002
2002
In this paper, we shall prove that the incidence coloring number for Halin graphs of maximum degree greater than or equal to 5… Expand
Is this relevant?
2002
2002
Abstract In 1993, Brualdi and Massey conjectured that every graph can be incidence-colored with Δ +2 colors, where Δ is the… Expand
Is this relevant?
1997
1997
Abstract In this note we show that the concept of incidence coloring introduced by Brualdi and Massey [4] is a special case of… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Abstract We define the incidence coloring number of a graph and bound it in terms of the maximum degree. The incidence coloring… Expand
Is this relevant?