The incidence chromatic number of some graph

The incidence chromatic number of some graph

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...

Full description

Bibliographic Details
Main Authors: Liu Xikui, Li Yan
Format: Article
Language:English
Published: Hindawi Limited 2005-01-01
Series:International Journal of Mathematics and Mathematical Sciences
Online Access:http://dx.doi.org/10.1155/IJMMS.2005.803
id doaj-627ad6b799a045f79850d8db17df481d
record_format Article
spelling doaj-627ad6b799a045f79850d8db17df481d2020-11-24T22:49:00ZengHindawi LimitedInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04252005-01-012005580381310.1155/IJMMS.2005.803The incidence chromatic number of some graphLiu Xikui0Li Yan1College of Information & Engineering, Shandong University of Science and Technology, Shandong, Qingdao 266510, ChinaCollege of Information & Engineering, Shandong University of Science and Technology, Shandong, Qingdao 266510, ChinaThe 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.http://dx.doi.org/10.1155/IJMMS.2005.803
collection DOAJ
language English
format Article
sources DOAJ
author Liu Xikui
Li Yan
spellingShingle Liu Xikui
Li Yan
The incidence chromatic number of some graph
International Journal of Mathematics and Mathematical Sciences
author_facet Liu Xikui
Li Yan
author_sort Liu Xikui
title The incidence chromatic number of some graph
title_short The incidence chromatic number of some graph
title_full The incidence chromatic number of some graph
title_fullStr The incidence chromatic number of some graph
title_full_unstemmed The incidence chromatic number of some graph
title_sort incidence chromatic number of some graph
publisher Hindawi Limited
series International Journal of Mathematics and Mathematical Sciences
issn 0161-1712
1687-0425
publishDate 2005-01-01
description 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.
url http://dx.doi.org/10.1155/IJMMS.2005.803
work_keys_str_mv AT liuxikui theincidencechromaticnumberofsomegraph
AT liyan theincidencechromaticnumberofsomegraph
AT liuxikui incidencechromaticnumberofsomegraph
AT liyan incidencechromaticnumberofsomegraph
_version_ 1725677677403176960

Similar Items