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 条
  • [31] Covering the Edges of a Random Hypergraph by Cliques
    Rodl, Vojtech
    Rucinski, Andrzej
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2022, 42 (04) : 1333 - 1349
  • [32] Cliques and Supercliques in a Graph
    Canoy Jr, Sergio R.
    Dela Cerna, Ramil H.
    Abragan, Armalene
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2023, 16 (01): : 243 - 252
  • [33] On chordal graph and line graph squares
    Scheidweiler, Robert
    Wiederrecht, Sebastian
    DISCRETE APPLIED MATHEMATICS, 2018, 243 : 239 - 247
  • [34] Computation of All Possible Maximal Cliques of a Weakly Triangulated Graph in Polynomial Time
    Bandyopadhyay, Sumana
    Pal, Rajat Kumar
    2014 SCIENCE AND INFORMATION CONFERENCE (SAI), 2014, : 159 - 168
  • [35] A linear time algorithm for enumerating all the minimum and minimal separators of a chordal graph
    Chandran, LS
    COMPUTING AND COMBINATORICS, 2001, 2108 : 308 - 317
  • [36] A GRAPH COVERING CONSTRUCTION OF ALL THE FINITE COMPLETE BIPREFIX CODES
    LALLEMENT, G
    PERRIN, D
    DISCRETE MATHEMATICS, 1981, 36 (03) : 261 - 271
  • [37] ON THE PARTITION AND COLORING OF A GRAPH BY CLIQUES
    WALLIS, WD
    ZHANG, GH
    DISCRETE MATHEMATICS, 1993, 120 (1-3) : 191 - 203
  • [38] Contracting a Chordal Graph to a Split Graph or a Tree
    Golovach, Petr A.
    Kaminski, Marcin
    Paulusma, Daniel
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 339 - 350
  • [39] On the maximum number of cliques in a graph
    Wood, David R.
    GRAPHS AND COMBINATORICS, 2007, 23 (03) : 337 - 352
  • [40] Graph searching on chordal graphs
    Peng, SL
    Ko, MT
    Ho, CW
    Hsu, TS
    Tang, CY
    ALGORITHMS AND COMPUTATION, 1996, 1178 : 156 - 165
12345