The obstructions of a minor-closed set of graphs defined by a context-free grammar

被引：0
|
作者：
Courcelle, B [1 ]
Senizergues, G [1 ]
机构：
[1] Univ Bordeaux 1, CNRS, LaBRI, URA 1304, F-33405 Talence, France
来源：
DISCRETE MATHEMATICS | 1998年 / 182卷 / 1-3期
关键词：
D O I：
10.1016/S0012-365X(97)83079-8
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We establish that the finite set of obstructions of a minor-closed set of graphs given by a hyperedge replacement grammar can be effectively constructed. Our proof uses an auxiliary result stating that the system of equations associated with a proper hyperedge replacement grammar has a unique solution.
引用
收藏
页码：29 / 51
页数：23
相关论文
共 50 条
  • [21] The Polytope of Context-Free Grammar Constraints
    Pesant, Gilles
    Quimper, Claude-Guy
    Rousseau, Louis-Martin
    Sellmann, Meinolf
    INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, PROCEEDINGS, 2009, 5547 : 223 - +
  • [22] COMPLETENESS OF CONTEXT-FREE GRAMMAR FORMS
    MAURER, HA
    SALOMAA, A
    WOOD, D
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1981, 23 (01) : 1 - 10
  • [23] ON INDEX OF A CONTEXT-FREE GRAMMAR AND LANGUAGE
    SALOMAA, A
    INFORMATION AND CONTROL, 1969, 14 (05): : 474 - &
  • [24] GRAPHS WHICH CANNOT REALIZE PLANAR GRID ARE DEDUCIBLE IN A CONTEXT-FREE GRAMMAR
    GORBUNOV, KY
    DOKLADY AKADEMII NAUK SSSR, 1991, 316 (02): : 270 - 274
  • [25] NON CONTEXT-FREE GRAMMAR FORMS
    MAURER, HA
    PENTTONEN, M
    SALOMAA, A
    WOOD, D
    MATHEMATICAL SYSTEMS THEORY, 1979, 12 (04): : 297 - 324
  • [26] EQUATIONS ASSOCIATED WITH A CONTEXT-FREE GRAMMAR
    COARDOS, V
    KYBERNETIKA, 1979, 15 (04) : 253 - 260
  • [27] Context-free pairs of groups I: Context-free pairs and graphs
    Ceccherini-Silberstein, Tullio
    Woess, Wolfgang
    EUROPEAN JOURNAL OF COMBINATORICS, 2012, 33 (07) : 1449 - 1466
  • [28] Properties and Limits of Supercombinator Set Acquired from Context-free Grammar Samples
    Sicak, Michal
    Kollar, Jan
    PROCEEDINGS OF THE 2017 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), 2017, : 711 - 720
  • [29] Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs
    Ding, Guoli
    Dziobiak, Stan
    COMBINATORICS PROBABILITY & COMPUTING, 2010, 19 (04): : 579 - 591
  • [30] STRONGLY EQUIVALENT CONTEXT-FREE GRAMMAR FORMS
    GINSBURG, S
    MAURER, HA
    COMPUTING, 1976, 16 (03) : 281 - 290
12345