Coloring perfect graphs with no balanced skew-partitions

被引：7
|
作者：
Chudnovsky, Maria [1 ]
Trotignon, Nicolas [2 ]
Trunck, Theophile [3 ]
Vuskovic, Kristina [4 ,5 ]
机构：
[1] Princeton Univ, Princeton, NJ 08544 USA
[2] Univ Lyon, INRIA, ENS Lyon, CNRS,LIP, Lyon, France
[3] Univ Lyon, INRIA, ENS Lyon, LIP, Lyon, France
[4] Univ Leeds, Sch Comp, Leeds, W Yorkshire, England
[5] Union Univ, Fac Comp Sci RAF, Belgrade, Serbia
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 2015年 / 115卷
基金：
英国工程与自然科学研究理事会;
关键词：
Perfect graphs; Berge graphs; Coloring; Maximum stable set; 2-join; Skew partition; Homogeneous pair; ALGORITHM;
D O I：
10.1016/j.jctb.2015.04.007
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We present an O(n(5)) algorithm that computes a maximum stable set of any perfect graph with no balanced skew-partition. We present O(n(7)) time algorithm that colors them. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码：26 / 65
页数：40
相关论文
共 50 条
  • [21] COLORING PERFECT PLANAR GRAPHS IN PARALLEL
    STEWART, IA
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 344 : 268 - 275
  • [22] On balanced coloring games in random graphs
    Gugelmann, Luca
    Spoehel, Reto
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2014, 35 : 297 - 312
  • [23] About skew partitions in minimal imperfect graphs
    Roussel, F
    Rubio, P
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2001, 83 (02) : 171 - 190
  • [24] MAXIMUM BALANCED 3-PARTITIONS OF GRAPHS
    Li, Haiyan
    Xu, Baogang
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2014, 6 (02)
  • [25] On the Parameterized Complexity of Computing Balanced Partitions in Graphs
    van Bevern, Rene
    Feldmann, Andreas Emil
    Sorge, Manuel
    Suchy, Ondrej
    [J]. THEORY OF COMPUTING SYSTEMS, 2015, 57 (01) : 1 - 35
  • [26] On the Parameterized Complexity of Computing Balanced Partitions in Graphs
    René van Bevern
    Andreas Emil Feldmann
    Manuel Sorge
    Ondřej Suchý
    [J]. Theory of Computing Systems, 2015, 57 : 1 - 35
  • [27] PERFECT CODES AND REGULAR PARTITIONS IN GRAPHS AND GROUPS
    ETIENNE, G
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 1987, 8 (02) : 139 - 144
  • [28] Minimum coloring problems with weakly perfect graphs
    Bahel, Eric
    Trudeau, Christian
    [J]. REVIEW OF ECONOMIC DESIGN, 2022, 26 (02) : 211 - 231
  • [29] TEST FRAGMENTS OF PERFECT COLORING OF CIRCULANT GRAPHS
    Lisitsyna, M. A.
    Avgustinovich, S., V
    [J]. SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2023, 20 (02): : 638 - 645
  • [30] COLORING BULL-FREE PERFECT GRAPHS
    Penev, Irena
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (03) : 1281 - 1309
12345