The incidence coloring conjecture for graphs of maximum degree 3

被引：40
|
作者：
Maydanskiy, M [1 ]
机构：
[1] MIT, Dept Math, Cambridge, MA 02139 USA
来源：
DISCRETE MATHEMATICS | 2005年 / 292卷 / 1-3期
基金：
美国国家科学基金会;
关键词：
cubic graph; incidence coloring;
D O I：
10.1016/j.disc.2005.02.003
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The incidence coloring conjecture, or ICC, states that any graph can be incidence-colored with Delta + 2 colors, where Delta is the maximum degree of the graph. After being introduced in 1993 by Brualdi and Massey, ICC was shown to be false in general by Guiduli in 1997, following the work of Algor and Alon. However, Shin, Lam and Chen conjectured that the ICC holds for cubic graphs and proved it for some classes of such graphs. In this paper we prove the ICC for any graph with Delta = 3. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：131 / 141
页数：11
相关论文
共 50 条
  • [1] On incidence coloring for some graphs of maximum degree 4
    Fahimi, Hamed
    Omoomi, Behnaz
    [J]. ARS COMBINATORIA, 2016, 125 : 33 - 45
  • [2] Incidence coloring of graphs with high maximum average degree
    Bonamy, Marthe
    Hocquard, Hervé
    Kerdjoudj, Samia
    Raspaud, André
    [J]. Discrete Applied Mathematics, 2017, 227 : 29 - 43
  • [3] Incidence coloring of graphs with high maximum average degree
    Bonamy, Marthe
    Hocquard, Herve
    Kerdjoudj, Samia
    Raspaud, Andre
    [J]. DISCRETE APPLIED MATHEMATICS, 2017, 227 : 29 - 43
  • [4] Equitable Total Coloring of Graphs with Maximum Degree 3
    Wei-Fan Wang
    [J]. Graphs and Combinatorics, 2002, 18 : 677 - 685
  • [5] Equitable total coloring of graphs with maximum degree 3
    Wang, WF
    [J]. GRAPHS AND COMBINATORICS, 2002, 18 (03) : 677 - 685
  • [6] On incidence coloring conjecture in Cartesian products of graphs
    Gregor, Petr
    Luzar, Borut
    Sotak, Roman
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 213 : 93 - 100
  • [7] Equitable list-coloring for graphs for maximum Degree 3
    Pelsmajer, MJ
    [J]. JOURNAL OF GRAPH THEORY, 2004, 47 (01) : 1 - 8
  • [8] Acyclic Coloring of Graphs with Maximum Degree 7
    Wang, Juan
    Miao, Lianying
    Song, Wenyao
    Liu, Yunlong
    [J]. GRAPHS AND COMBINATORICS, 2021, 37 (02) : 455 - 469
  • [9] Acyclic Coloring of Graphs with Maximum Degree 7
    Juan Wang
    Lianying Miao
    Wenyao Song
    Yunlong Liu
    [J]. Graphs and Combinatorics, 2021, 37 : 455 - 469
  • [10] Coloring Squares of Planar Graphs with Small Maximum Degree
    Krzyzinski, Mateusz
    Rzazewski, Pawel
    Tur, Szymon
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2024, 44 (03) : 817 - 835
12345