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
来源：
Journal of Combinatorial Mathematics and Combinatorial Computing | 2019年 / 111卷
关键词：
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 条
  • [21] Fast Distributed Coloring Algorithms for Triangle-Free Graphs
    Pettie, Seth
    Su, Hsin-Hao
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2013, 7966 : 681 - 693
  • [22] Triangle-free graphs with large independent domination number
    Shiu, Wai Chee
    Chen, Xue-gang
    Chan, Wai Hong
    DISCRETE OPTIMIZATION, 2010, 7 (1-2) : 86 - 92
  • [23] The independent domination number of maximal triangle-free graphs
    Wang, Changping
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2008, 42 : 129 - 136
  • [24] Acyclic edge coloring of triangle-free toroidal graphs
    Xu, Yian
    ARS COMBINATORIA, 2011, 100 : 33 - 42
  • [25] Fast 3-coloring triangle-free planar graphs
    Kowalik, L
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 436 - 447
  • [26] Fast 3-coloring Triangle-Free Planar Graphs
    Lukasz Kowalik
    Algorithmica, 2010, 58 : 770 - 789
  • [27] Fast 3-coloring Triangle-Free Planar Graphs
    Kowalik, Lukasz
    ALGORITHMICA, 2010, 58 (03) : 770 - 789
  • [28] Neighborhood Total Domination and Maximum Degree in Triangle-Free Graphs
    Henning, Michael A.
    Mojdeh, D. A.
    Salehi, M. R. Sayed
    UTILITAS MATHEMATICA, 2018, 107 : 137 - 150
  • [29] Coloring graphs with no even hole ≥ 6: the triangle-free case
    Lagoutte, Aureie
    ELECTRONIC JOURNAL OF COMBINATORICS, 2017, 24 (03):
  • [30] On Coloring Parameters of Triangle-Free Planar (n, m)-Graphs
    Nandi, Soumen
    Sen, Sagnik
    Taruni, S.
    GRAPHS AND COMBINATORICS, 2024, 40 (06)
12345