REDUCING PRIME GRAPHS AND RECOGNIZING CIRCLE GRAPHS

被引：79
|
作者：
BOUCHET, A [1 ]
机构：
[1] UNIV MAINE,F-72017 LE MANS,FRANCE
来源：
COMBINATORICA | 1987年 / 7卷 / 03期
关键词：
D O I：
10.1007/BF02579301
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：243 / 254
页数：12
相关论文
共 50 条
  • [31] On polygon numbers of circle graphs and distance hereditary graphs
    Stewart, Lorna
    Valenzano, Richard
    DISCRETE APPLIED MATHEMATICS, 2018, 248 : 3 - 17
  • [32] A distance measure for large graphs based on prime graphs
    Lagraa, Sofiane
    Seba, Hamida
    Khennoufa, Riadh
    M'Baya, Abir
    Kheddouci, Hamamache
    PATTERN RECOGNITION, 2014, 47 (09) : 2993 - 3005
  • [33] Recognizing Planar Laman Graphs
    Rollin, Jonathan
    Schlipf, Lena
    Schulz, Andre
    27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
  • [34] RECOGNIZING LOCALLY EQUIVALENT GRAPHS
    BOUCHET, A
    DISCRETE MATHEMATICS, 1993, 114 (1-3) : 75 - 86
  • [35] RECOGNIZING GENERALIZED SIERPINSKI GRAPHS
    Imrich, Wilfried
    Peterin, Iztok
    APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2020, 14 (01) : 122 - 137
  • [36] On the Complexity of Recognizing Wheeler Graphs
    Gibney, Daniel
    Thankachan, Sharma, V
    ALGORITHMICA, 2022, 84 (03) : 784 - 814
  • [37] Recognizing DNA graphs is difficult
    Pendavingh, R
    Schuurman, P
    Woeginger, GJ
    DISCRETE APPLIED MATHEMATICS, 2003, 127 (01) : 85 - 94
  • [38] Recognizing random intersection graphs
    Prisner, E
    DISCRETE MATHEMATICS, 2000, 223 (1-3) : 263 - 274
  • [39] Recognizing string graphs in NP
    Schaefer, M
    Sedgwick, E
    Stefankovic, D
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 67 (02) : 365 - 380
  • [40] On the Complexity of Recognizing Wheeler Graphs
    Daniel Gibney
    Sharma V. Thankachan
    Algorithmica, 2022, 84 : 784 - 814
12345