On covering all cliques of a chordal graph

被引：0
|
作者：
Mathematisches Seminar, Universität Hamburg, Bundesstr. 55, D-20146 Hamburg, Germany [1 ]
机构：
来源：
Discrete Math | / 1-3卷 / 299-302期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
8
引用
收藏
相关论文
共 50 条
  • [21] CLIQUE COVERING OF CHORDAL GRAPHS
    MA, S
    WALLIS, WD
    WU, J
    UTILITAS MATHEMATICA, 1989, 36 : 151 - 152
  • [22] Covering cliques with spanning bicliques
    Kundgen, A
    JOURNAL OF GRAPH THEORY, 1998, 27 (04) : 223 - 227
  • [23] Packing r-Cliques in Weighted Chordal Graphs
    P. Hell
    S. Klein
    L. T. Nogueira
    F. Protti
    Annals of Operations Research, 2005, 138 : 179 - 187
  • [24] Enumeration Methods for All Maximal and theta -Maximal Cliques in a Graph.
    Schneider, Michel
    Revue Francaise d'Automatique Informatique Recherche Operationnelle, 1973, 3 : 21 - 33
  • [25] The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
    Studeny, Milan
    Cussens, James
    Kratochvil, Vaclav
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2021, 138 : 188 - 203
  • [26] METHODS FOR ENUMERATING ALL MAXIMAL AND THETA-MAXIMAL CLIQUES IN A GRAPH
    SCHNEIDE.M
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1973, (NV-3): : 21 - 33
  • [27] Packing r-cliques in weighted chordal graphs
    Hell, P
    Klein, S
    Nogueira, LT
    Protti, F
    ANNALS OF OPERATIONS RESEARCH, 2005, 138 (01) : 179 - 187
  • [28] Reconfiguration of Cliques in a Graph
    Ito, Takehiro
    Ono, Hirotaka
    Otachi, Yota
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2015), 2015, 9076 : 212 - 223
  • [29] Reconfiguration of cliques in a graph
    Ito, Takehiro
    Ono, Hirotaka
    Otachi, Yota
    DISCRETE APPLIED MATHEMATICS, 2023, 333 : 43 - 58
  • [30] THE SQUARE OF A CHORDAL GRAPH
    HARARY, F
    MCKEE, TA
    DISCRETE MATHEMATICS, 1994, 128 (1-3) : 165 - 172
12345