Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

2016

2016

An incidence in a graph G is a pair ( v , e ) where v is a vertex of G and e is an edge of G incident to v . Two incidences ( v… Expand

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

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

Highly Cited

2005

Highly Cited

2005

The incidence coloring conjecture, or ICC, states that any graph can be incidence-colored with @D+2 colors, where @D is the… Expand

2004

2004

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

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

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

2002

2002

Abstract In 1993, Brualdi and Massey conjectured that every graph can be incidence-colored with Δ+2 colors, where Δ is the… Expand

Highly Cited

1997

Highly Cited

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

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