Coloring Graphs with Dense Neighborhoods

被引:5
|
作者
Rabern, Landon [1 ]
机构
[1] LBD Data, Orange, CT 06477 USA
关键词
coloring; dense; Reed's conjecture; Borodin-Kostochka conjecture; Brooks' theorem; TRANSVERSALS;
D O I
10.1002/jgt.21768
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
It is shown that any graph with maximum degree in which the average degree of the induced subgraph on the set of all neighbors of each vertex exceeds 6k26k2+1+k+6 is either (-k)-colorable or contains a clique on more than -2k vertices. In the k=1 case we improve the bound on the average degree to 23+4 and the bound on the clique number to -1. As corollaries, we show that every graph satisfies max{,-1,4} and every graph satisfies max{,-1,remvoe15+48n+734}.
引用
收藏
页码:323 / 340
页数:18
相关论文
共 50 条
  • [1] Coloring graphs with sparse neighborhoods
    Alon, N
    Krivelevich, M
    Sudakov, B
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1999, 77 (01) : 73 - 82
  • [2] DENSE GRAPHS WITH CYCLE NEIGHBORHOODS
    SERESS, A
    SZABO, T
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1995, 63 (02) : 281 - 293
  • [3] Clique coloring of dense random graphs
    Alon, Noga
    Krivelevich, Michael
    [J]. JOURNAL OF GRAPH THEORY, 2018, 88 (03) : 428 - 433
  • [4] COLORING AND COVERING NOWHERE DENSE GRAPHS
    Grohe, Martin
    Kreutzer, Stephan
    Rabinovich, Roman
    Siebertz, Sebastian
    Stavropoulos, Konstantinos
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (04) : 2467 - 2481
  • [5] THE COMPLEXITY OF COLORING PROBLEMS ON DENSE GRAPHS
    EDWARDS, K
    [J]. THEORETICAL COMPUTER SCIENCE, 1986, 43 (2-3) : 337 - 343
  • [6] The total dominator coloring of dense, octahedral and queen's graphs
    Lazuardi, A. R.
    Slamin
    Dafik
    Kurniawati, E. Y.
    Maylisa, I. N.
    [J]. 2ND INTERNATIONAL CONFERENCE ON PHYSICS AND MATHEMATICS FOR BIOLOGICAL SCIENCE (2ND ICOPAMBS) 2020, 2021, 1832
  • [7] STRUCTURE OF NEIGHBORHOODS OF EDGES IN PLANAR GRAPHS AND SIMULTANEOUS COLORING OF VERTICES, EDGES AND FACES
    BORODIN, OV
    [J]. MATHEMATICAL NOTES, 1993, 53 (5-6) : 483 - 489
  • [8] Coloring Graphs in Oriented Coloring of Cubic Graphs
    Dybizbanski, Janusz
    [J]. GRAPHS AND COMBINATORICS, 2022, 38 (05)
  • [9] Coloring Graphs in Oriented Coloring of Cubic Graphs
    Janusz Dybizbański
    [J]. Graphs and Combinatorics, 2022, 38
  • [10] A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs
    Bhyravarapu, Sriram
    Kalyanasundaram, Subrahmanyam
    Mathew, Rogers
    [J]. JOURNAL OF GRAPH THEORY, 2021, 97 (04) : 553 - 556