Coloring and Domination of Vertices in Triangle-free Graphs

被引:0
|
作者
Dutton, Ronald [1 ]
机构
[1] Department of Computer Science, University of Central Florida, Orlando,FL,32816, United States
关键词
Graph theory;
D O I
暂无
中图分类号
O144 [集合论]; O157 [组合数学(组合学)];
学科分类号
070104 ;
摘要
Any dominating set of vertices in a triangle-free graph can be used to specify a graph coloring with at most one color class more than the number of vertices in the dominating set. This bound is sharp for many graphs. Properties of graphs for which this bound is achieved are presented. © 2019 Charles Babbage Research Centre. All rights reserved.
引用
收藏
页码:137 / 143
相关论文
共 50 条
  • [41] The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices
    Matsumoto, Naoki
    Tanaka, Minako
    AEQUATIONES MATHEMATICAE, 2021, 95 (02) : 319 - 328
  • [42] The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices
    Naoki Matsumoto
    Minako Tanaka
    Aequationes mathematicae, 2021, 95 : 319 - 328
  • [43] List Coloring Triangle-Free Hypergraphs
    Cooper, Jeff
    Mubayi, Dhruv
    RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (03) : 487 - 519
  • [44] Median graphs and triangle-free graphs
    Imrich, W
    Klavzar, S
    Mulder, HM
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1999, 12 (01) : 111 - 118
  • [45] Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies
    Dvorak, Zdenek
    Kral, Daniel
    Thomas, Robin
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2021, 150 : 244 - 269
  • [46] Triangle-free equimatchable graphs
    Buyukcolak, Yasemin
    Ozkan, Sibel
    Gozupek, Didem
    JOURNAL OF GRAPH THEORY, 2022, 99 (03) : 461 - 484
  • [47] On triangle-free random graphs
    Luczak, T
    RANDOM STRUCTURES & ALGORITHMS, 2000, 16 (03) : 260 - 276
  • [48] On triangle-free projective graphs
    Hazan, S
    ALGEBRA UNIVERSALIS, 1996, 35 (02) : 185 - 196
  • [49] On the evolution of triangle-free graphs
    Steger, A
    COMBINATORICS PROBABILITY & COMPUTING, 2005, 14 (1-2): : 211 - 224
  • [50] ON MAXIMAL TRIANGLE-FREE GRAPHS
    ERDOS, P
    HOLZMAN, R
    JOURNAL OF GRAPH THEORY, 1994, 18 (06) : 585 - 594