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 条
  • [31] Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs
    Pascal Ochem
    Alexandre Pinlou
    Graphs and Combinatorics, 2014, 30 : 439 - 453
  • [32] Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs
    Ochem, Pascal
    Pinlou, Alexandre
    GRAPHS AND COMBINATORICS, 2014, 30 (02) : 439 - 453
  • [33] Acyclic edge coloring of triangle-free 1-planar graphs
    Wen Yao Song
    Lian Ying Miao
    Acta Mathematica Sinica, English Series, 2015, 31 : 1563 - 1570
  • [34] Three-Coloring Triangle-Free Planar Graphs in Linear Time
    Dvorak, Zdenek
    Kawarabayashi, Ken-Ichi
    Thomas, Robin
    ACM TRANSACTIONS ON ALGORITHMS, 2011, 7 (04)
  • [35] Acyclic Edge Coloring of Triangle-free 1-planar Graphs
    Wen Yao SONG
    Lian Ying MIAO
    Acta Mathematica Sinica,English Series, 2015, (10) : 1563 - 1570
  • [36] Acyclic Edge Coloring of Triangle-free 1-planar Graphs
    Song, Wen Yao
    Miao, Lian Ying
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2015, 31 (10) : 1563 - 1570
  • [37] Three-coloring triangle-free planar graphs in linear time
    Dvorak, Zdenek
    Kawarabayashi, Ken-ichi
    Thomas, Robin
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 1176 - +
  • [38] Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle
    Dvorak, Zdenek
    Kral', Daniel
    Thomas, Robin
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 120 : 1 - 17
  • [39] An algorithm for 12-[5]coloring of triangle-free hexagonal graphs
    Zerovnik, J
    ITI 2005: PROCEEDINGS OF THE 27TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES, 2005, : 673 - 678
  • [40] Acyclic Edge Coloring of Triangle-free 1-planar Graphs
    Wen Yao SONG
    Lian Ying MIAO
    Acta Mathematica Sinica, 2015, 31 (10) : 1563 - 1570
12345