PURE SIMPLICIAL COMPLEXES AND WELL-COVERED GRAPHS

被引：2
|
作者：
Zaare-Nahandi, Rashid [1 ]
机构：
[1] IASBS, Zanjan 45195, Iran
来源：
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS | 2015年 / 45卷 / 02期
关键词：
Well-covered graph; pure simplicial complex; clique cover; perfect graph; BARYCENTRIC SUBDIVISIONS;
D O I：
10.1216/RMJ-2015-45-2-695
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we provide some necessary and sufficient conditions to check when a (semi-)perfect graph is well-covered. We show that the checking process of these conditions can be achieved in a polynomial time. Since the comparability graph of a simplicial complex is a perfect graph, our result carries over to simplicial complexes.
引用
收藏
页码：695 / 702
页数：8
相关论文
共 50 条
  • [1] Equistable simplicial, very well-covered, and line graphs
    Levit, Vadim E.
    Milanic, Martin
    DISCRETE APPLIED MATHEMATICS, 2014, 165 : 205 - 212
  • [2] Independence Complexes of Well-Covered Circulant Graphs
    Earl, Jonathan
    Vander Meulen, Kevin N.
    Van Tuyl, Adam
    EXPERIMENTAL MATHEMATICS, 2016, 25 (04) : 441 - 451
  • [3] STRONGLY WELL-COVERED GRAPHS
    PINTER, MR
    DISCRETE MATHEMATICS, 1994, 132 (1-3) : 231 - 246
  • [4] WELL-COVERED GRAPHS AND EXTENDABILITY
    DEAN, N
    ZITO, J
    DISCRETE MATHEMATICS, 1994, 126 (1-3) : 67 - 80
  • [5] Constructions for well-covered graphs
    Finbow, A. S.
    Whitehead, C. A.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2018, 72 : 273 - 289
  • [6] Well-covered graphs and factors
    Randerath, B
    Vestergaard, PD
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (09) : 1416 - 1428
  • [7] Stable Well-Covered Graphs
    King, Erika L. C.
    ARS COMBINATORIA, 2009, 93 : 313 - 319
  • [8] Well-Covered Token Graphs
    Abdelmalek, F. M.
    Vander Meulen, Esther
    Vander Meulen, Kevin N.
    Van Tuyl, Adam
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2023, 43 (03) : 767 - 792
  • [9] Well-covered circulant graphs
    Brown, Jason
    Hoshino, Richard
    DISCRETE MATHEMATICS, 2011, 311 (04) : 244 - 251
  • [10] COMPLEXITY RESULTS FOR WELL-COVERED GRAPHS
    SANKARANARAYANA, RS
    STEWART, LK
    NETWORKS, 1992, 22 (03) : 247 - 262
12345