Affordable Access

The incidence chromatic number of some graph

Authors
Publisher
International Journal of Mathematics and Mathematical Sciences
Publication Date

Abstract

The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey (1993). They conjectured that every graph G can be incidence colored with Δ(G)+2 colors. In this paper, we calculate the incidence chromatic numbers of the complete k-partite graphs and give the incidence chromatic number of three infinite families of graphs.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

The total chromatic number of some bipartite graph...

on Electronic Notes in Discrete M... Jan 01, 2005

Bounds for the b-chromatic number of some families...

on Discrete Mathematics Jan 01, 2006

Circular chromatic numbers of some distance graphs

on Discrete Mathematics Jan 01, 2005
More articles like this..