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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2005-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/IJMMS.2005.803 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832550000803971072 |
|---|---|
| author | Liu Xikui Li Yan |
| author_facet | Liu Xikui Li Yan |
| author_sort | Liu Xikui |
| collection | DOAJ |
| 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. |
| format | Article |
| id | doaj-art-627ad6b799a045f79850d8db17df481d |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 2005-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-627ad6b799a045f79850d8db17df481d2025-02-03T06:07:55ZengWileyInternational 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 |
| spellingShingle | Liu Xikui Li Yan The incidence chromatic number of some graph International Journal of Mathematics and Mathematical Sciences |
| title | 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_short | The incidence chromatic number of some graph |
| title_sort | incidence chromatic number of some graph |
| 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 |