Partitions of graphs into one or two independent sets and cliques (vol 152, pg 47, 1996)

被引:20
|
作者
Brandstadt, A
机构
关键词
D O I
10.1016/S0012-365X(98)00014-4
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:295 / 295
页数:1
相关论文
共 50 条
  • [1] Partitions of graphs into one or two independent sets and cliques [Discrete Math. 152 (1996) 47-54]
    Brandstadt, A.
    [J]. Discrete Mathematics, 1998, 186 (1-3):
  • [2] Partitions of graphs into one or two independent sets and cliques
    Brandstadt, A
    [J]. DISCRETE MATHEMATICS, 1996, 152 (1-3) : 47 - 54
  • [3] Partitions of graphs into one or two independent sets and cliques
    Universität Rostock, FB Informatik, D 18051 Rostock, Germany
    [J]. Discrete Math, 1-3 (47-54):
  • [4] INDEPENDENT SETS, CLIQUES AND HAMILTONIAN GRAPHS
    LIU, X
    [J]. GRAPHS AND COMBINATORICS, 1995, 11 (03) : 267 - 273
  • [5] On the densities of cliques and independent sets in graphs
    Hao Huang
    Nati Linial
    Humberto Naves
    Yuval Peled
    Benny Sudakov
    [J]. Combinatorica, 2016, 36 : 493 - 512
  • [6] On the densities of cliques and independent sets in graphs
    Huang, Hao
    Linial, Nati
    Naves, Humberto
    Peled, Yuval
    Sudakov, Benny
    [J]. COMBINATORICA, 2016, 36 (05) : 493 - 512
  • [7] Partitioning chordal graphs into independent sets and cliques
    Hell, P
    Klein, S
    Nogueira, LT
    Protti, F
    [J]. DISCRETE APPLIED MATHEMATICS, 2004, 141 (1-3) : 185 - 194
  • [8] Balanced independent sets in graphs omitting large cliques
    Laflamme, Claude
    Aranda, Andres
    Soukup, Daniel T.
    Woodrow, Robert
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2019, 137 : 1 - 9
  • [9] Maximum weight independent sets and cliques in intersection graphs of filaments
    Gavril, F
    [J]. INFORMATION PROCESSING LETTERS, 2000, 73 (5-6) : 181 - 188
  • [10] DISJOINT CLIQUES AND DISJOINT MAXIMAL INDEPENDENT SETS OF VERTICES IN GRAPHS
    ERDOS, P
    HOBBS, AM
    PAYAN, C
    [J]. DISCRETE MATHEMATICS, 1982, 42 (01) : 57 - 61