The incidence chromatic number of some graph

Liu Xikui and Li Yan

International Journal of Mathematics and Mathematical Sciences, 2005, vol. 2005, 1-11

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.

Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2005/293630.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2005/293630.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:293630

DOI: 10.1155/IJMMS.2005.803

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().