INDUCED SUBGRAPHS AND WELL-QUASI-ORDERING

被引：44
|
作者：
DAMASCHKE, P
机构：
[1] Friedrich-Schiller Universität Jena, Sektion Mathematik, Jena, Universitätshochhaus
来源：
JOURNAL OF GRAPH THEORY | 1990年 / 14卷 / 04期
关键词：
D O I：
10.1002/jgt.3190140406
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We study classes of finite, simple, undirected graphs that are (1) lower ideals (or hereditary) in the partial order of graphs by the induced subgraph relation ≤i, and (2) well‐quasi‐ordered (WQO) by this relation. The main result shows that the class of cographs (P4‐free graphs) is WQO by ≤i, and that this is the unique maximal lower ideal with one forbidden subgraph that is WQO. This is a consequence of the famous Kruskal theorem. Modifying our idea we can prove that P4‐reducible graphs build a WQO class. Other examples of lower ideals WQO by ≤i are also given. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company
引用
收藏
页码：427 / 435
页数：9
相关论文
共 50 条
  • [21] Well-Quasi-Ordering Hereditarily Finite Sets
    Policriti, Alberto
    Tomescu, Alexandru I.
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2011, 6638 : 440 - 451
  • [22] A Counterexample Regarding Labelled Well-Quasi-Ordering
    Robert Brignall
    Michael Engen
    Vincent Vatter
    Graphs and Combinatorics, 2018, 34 : 1395 - 1409
  • [23] Well-quasi-ordering and finite distinguishing number
    Atminas, Aistis
    Brignall, Robert
    JOURNAL OF GRAPH THEORY, 2020, 95 (01) : 5 - 26
  • [24] Integer packing sets form a well-quasi-ordering
    Del Pia, Alberto
    Gijswijt, Dion
    Linderoth, Jeff
    Zhu, Haoran
    OPERATIONS RESEARCH LETTERS, 2021, 49 (02) : 226 - 230
  • [25] Strong immersion is a well-quasi-ordering for semicomplete digraphs
    Barbero, Florian
    Paul, Christophe
    Pilipczuk, Michal
    JOURNAL OF GRAPH THEORY, 2019, 90 (04) : 484 - 496
  • [26] ON WELL-QUASI-ORDERING LOWER SETS OF FINITE TREES
    NASHWILLIAMS, CSA
    PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1964, 60 (03): : 369 - &
  • [27] Well-quasi-ordering versus clique-width
    Lozin, Vadim
    Razgon, Igor
    Zamaraev, Viktor
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2018, 130 : 1 - 18
  • [28] WELL-QUASI-ORDERING OF COUNTABLE SERIES-PARALLEL ORDERS
    THOMASSE, S
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1993, 317 (10): : 909 - 912
  • [29] GRAPHS WITHOUT K4 AND WELL-QUASI-ORDERING
    THOMAS, R
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 38 (03) : 240 - 247
  • [30] Branch-width and well-quasi-ordering in matroids and graphs
    Geelen, JF
    Gerards, AMH
    Whittle, G
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2002, 84 (02) : 270 - 290
12345