GREEDY ALGORITHMS FOR TRIANGLE FREE COLORING

被引：0
|
作者：
Szabo, S. [1 ]
Zavalnij, B. [1 ]
机构：
[1] Univ Pecs, Inst Math & Informat, Ifjusag U 6, H-7624 Pecs, Hungary
来源：
AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2012年 / 9卷 / 02期
关键词：
clique; maximum clique; independent set; vertex coloring; s-clique free set; s-clique free coloring; clique search algorithm; satisfiability solver; greedy coloring;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
According to [2] the capability of providing good bounds for the size of a maximum clique in a graph is a critical ingredient of an efficient clique search algorithm. In order to establish upper bounds of the size of a maximum clique we introduce some new coloring schemes using s-clique free partitioning. A complexity result will show that finding the optimal number of colors is an NP -complete problem. This can be interpreted loosely as a computational limitation. To overcome this difficulty for practical purposes we suggest various greedy coloring procedures.
引用
收藏
页码：169 / 186
页数：18
相关论文
共 50 条
  • [1] Distributed coloring algorithms for triangle-free graphs
    University of Michigan, Ann Arbor
    MI
    48105, United States
    [J]. Inf Comput, (263-280):
  • [2] Distributed coloring algorithms for triangle-free graphs
    Pettie, Seth
    Su, Hsin-Hao
    [J]. INFORMATION AND COMPUTATION, 2015, 243 : 263 - 280
  • [3] Fast distributed coloring algorithms for triangle-free graphs
    [J]. Springer Verlag (7966 LNCS):
  • [4] Fast Distributed Coloring Algorithms for Triangle-Free Graphs
    Pettie, Seth
    Su, Hsin-Hao
    [J]. AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2013, 7966 : 681 - 693
  • [5] Coloring triangle-free graphs on surfaces
    Dvorak, Zdenek
    Kral, Daniel
    Thomas, Robin
    [J]. ALGORITHMS AND COMPUTATION, 2007, 4835 : 2 - +
  • [6] Coloring triangle-free graphs on surfaces
    Dvorak, Zdenek
    Kral, Daniel
    Thomas, Robin
    [J]. PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 120 - +
  • [7] List Coloring Triangle-Free Hypergraphs
    Cooper, Jeff
    Mubayi, Dhruv
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (03) : 487 - 519
  • [8] Connected greedy coloring of H-free graphs
    Mota, Esdras
    Rocha, Leonardo
    Silva, Ana
    [J]. DISCRETE APPLIED MATHEMATICS, 2020, 284 (284) : 572 - 584
  • [9] Backbone coloring for triangle-free planar graphs
    Yue-hua Bu
    Shui-ming Zhang
    [J]. Acta Mathematicae Applicatae Sinica, English Series, 2017, 33 : 819 - 824
  • [10] Coloring triangle-free graphs with fixed size
    Gimbel, J
    Thomassen, C
    [J]. DISCRETE MATHEMATICS, 2000, 219 (1-3) : 275 - 277
12345