A new characterization of trivially perfect graphs

被引：2
|
作者：
Rubio-Montiel, Christian [1 ]
机构：
[1] Univ Nacl Autonoma Mexico, Inst Matemat, Ciudad Univ, Mexico City 04510, DF, Mexico
来源：
ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS | 2015年 / 3卷 / 01期
关键词：
Perfect graphs; complete coloring; Grundy number; forbidden graph characterization;
D O I：
10.5614/ejgta.2015.3.1.3
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph G is trivially perfect if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number) alpha(G) equals the number of (maximal) cliques m(G). We characterize the trivially perfect graphs in terms of vertex-coloring and we extend some definitions to infinite graphs.
引用
收藏
页码：22 / 26
页数：5
相关论文
共 50 条
  • [1] TRIVIALLY PERFECT GRAPHS
    GOLUMBIC, MC
    [J]. DISCRETE MATHEMATICS, 1978, 24 (01) : 105 - 107
  • [2] On Polar, Trivially Perfect Graphs
    Talmaciu, M.
    Nechita, E.
    [J]. INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2010, 5 (05) : 939 - 945
  • [3] Probe threshold and probe trivially perfect graphs
    Bayer, Daniel
    Le, Van Bang
    de Ridder, H. N.
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 4812 - 4822
  • [4] An Algorithm For The Bisection Problem On Trivially Perfect Graphs
    Talmaciu, Mihai
    Nechita, Elena
    [J]. ADVANCED BIO-INSPIRED COMPUTATIONAL METHODS, 2008, : 87 - 93
  • [5] An Algorithm for the Bisection Problem on Trivially Perfect Graphs
    Talmaciu, Mihai
    Nechita, Elena
    [J]. BICS 2008: PROCEEDINGS OF THE 1ST INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTATIONAL METHODS USED FOR SOLVING DIFFICULT PROBLEMS-DEVELOPMENT OF INTELLIGENT AND COMPLEX SYSTEMS, 2008, 1117 : 60 - 66
  • [6] Computing square roots of trivially perfect and threshold graphs
    Milanic, Martin
    Schaudt, Oliver
    [J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (10-11) : 1538 - 1545
  • [7] The Chromatic Symmetric Functions of Trivially Perfect Graphs and Cographs
    Tsujie, Shuhei
    [J]. GRAPHS AND COMBINATORICS, 2018, 34 (05) : 1037 - 1048
  • [8] The Chromatic Symmetric Functions of Trivially Perfect Graphs and Cographs
    Shuhei Tsujie
    [J]. Graphs and Combinatorics, 2018, 34 : 1037 - 1048
  • [9] A new characterization of perfect graphs
    Galeana-Sanchez, Hortensia
    [J]. DISCRETE MATHEMATICS, 2012, 312 (17) : 2751 - 2755
  • [10] TRIVIALLY EXTENDABLE GRAPHS
    Angaleeswari, K.
    Sumathi, P.
    Swaminathan, V.
    [J]. TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2015, 5 (02): : 307 - 313
12345