CLIQUE COVERINGS OF GRAPHS .5. MAXIMAL-CLIQUE PARTITIONS

被引:10
|
作者
PULLMAN, NJ [1 ]
SHANK, H [1 ]
WALLIS, WD [1 ]
机构
[1] UNIV NEWCASTLE,DEPT MATH,NEWCASTLE,NSW 2308,AUSTRALIA
关键词
D O I
10.1017/S0004972700005414
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:337 / 356
页数:20
相关论文
共 50 条
  • [41] Clique transversal and clique independence on comparability graphs
    Balachandran, V
    Nagavamsi, P
    Rangan, CP
    INFORMATION PROCESSING LETTERS, 1996, 58 (04) : 181 - 184
  • [42] CLIQUE IRREDUCIBILITY AND CLIQUE VERTEX IRREDUCIBILITY OF GRAPHS
    Lakshmanan S, Aparna
    Vijayakumar, A.
    APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2009, 3 (01) : 137 - 146
  • [43] Clique partitions of distance multigraphs
    Cavers, Michael S.
    Elzinga, Randall J.
    Gregory, David A.
    Vanderlinde, Sarah E.
    Vander Meulen, Kevin N.
    DISCRETE MATHEMATICS, 2008, 308 (15) : 3230 - 3240
  • [44] A new decomposition technique for maximal clique enumeration for sparse graphs
    Manoussakis, George
    THEORETICAL COMPUTER SCIENCE, 2019, 770 : 25 - 33
  • [45] CLIQUE GRAPHS OF TIME GRAPHS
    HEDMAN, B
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 37 (03) : 270 - 278
  • [46] Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs
    Pardalos, Panos M.
    Rebennack, Steffen
    EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2010, 6049 : 13 - 22
  • [47] ON THE NUMBER OF DISTINCT MINIMAL CLIQUE PARTITIONS AND CLIQUE COVERS OF A LINE GRAPH
    MCGUINNESS, S
    REES, R
    DISCRETE MATHEMATICS, 1990, 83 (01) : 49 - 62
  • [48] Fast Maximal Clique Enumeration for Real-World Graphs
    Li, Yinuo
    Shao, Zhiyuan
    Yu, Dongxiao
    Liao, Xiaofei
    Jin, Hai
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2019), PT I, 2019, 11446 : 641 - 658
  • [49] CLIQUE GRAPHS AND HELLY GRAPHS
    BANDELT, HJ
    PRISNER, E
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1991, 51 (01) : 34 - 45
  • [50] On self-clique graphs with given clique sizes
    Chia, GL
    DISCRETE MATHEMATICS, 2000, 212 (03) : 185 - 189