Perfectly contractile diamond-free graphs

被引：0
|
作者：
Universitá d'Orláans, L.I.F.O., B.P. 6759, 45067 Orláans Cedex 2, France [1 ]
机构：
来源：
J. Graph Theory | / 4卷 / 359-389期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Perfectly contractile diamond-free graphs
    Rusu, I
    JOURNAL OF GRAPH THEORY, 1999, 32 (04) : 359 - 389
  • [2] On the connectivity of diamond-free graphs
    Dankelmann, Peter
    Hellwig, Angelika
    Volkmann, Lutz
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (16) : 2111 - 2117
  • [3] Colouring diamond-free graphs
    Dabrowski, Konrad K.
    Dross, Francois
    Paulusma, Daniel
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 89 : 410 - 431
  • [4] On the Competition Numbers of Diamond-Free Graphs
    Sano, Yoshio
    DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 2016, 9943 : 247 - 252
  • [5] Recognition algorithm for diamond-free graphs
    Talmaciu, Mihai
    Nechita, Elena
    INFORMATICA, 2007, 18 (03) : 457 - 462
  • [6] Strong cliques in diamond-free graphs
    Chiarelli, Nina
    Martinez-Barona, Berenice
    Milanic, Martin
    Monnot, Jerome
    Mursic, Peter
    THEORETICAL COMPUTER SCIENCE, 2021, 858 : 49 - 63
  • [7] Strong Cliques in Diamond-Free Graphs
    Chiarelli, Nina
    Martinez-Barona, Berenice
    Milanic, Martin
    Monnot, Jerome
    Mursic, Peter
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2020, 2020, 12301 : 261 - 273
  • [8] On weakly diamond-free Berge graphs
    Haddadene, HA
    Gravier, S
    DISCRETE MATHEMATICS, 1996, 159 (1-3) : 237 - 240
  • [9] Unique intersectability of diamond-free graphs
    Guo, Jun-Lin
    Wang, Tao-Ming
    Wang, Yue-Li
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (08) : 774 - 778
  • [10] ON A FAMILY OF DIAMOND-FREE STRONGLY REGULAR GRAPHS
    Mohammadian, A.
    Tayfeh-Rezaie, B.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (04) : 1906 - 1915
12345