Induced subgraphs and well‐quasi‐ordering
Author:
- 1 September 1990
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 14 (4) , 427-435
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- Graphentheorie1989
- P4‐Reducible Graphs—Class of Uniquely Tree‐Representable GraphsStudies in Applied Mathematics, 1989
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Wohlquasigeordnete Klassen endlicher GraphenJournal of Combinatorial Theory, Series B, 1972
- On well-quasi-ordering finite treesMathematical Proceedings of the Cambridge Philosophical Society, 1963
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's ConjectureTransactions of the American Mathematical Society, 1960
- Ordering by Divisibility in Abstract AlgebrasProceedings of the London Mathematical Society, 1952