Title

Subgraphs and well‐quasi‐ordering

Document Type

Article

Publication Date

1-1-1992

Abstract

Let �� be a class of graphs and let ⪯ be the subgraph or the induced subgraph relation. We call ⪯ an ideal (with respect to ⪯) if ⪯ implies that ⪯. In this paper, we study the ideals that are well‐quasiordered by ⪯. The following are our main results. If ⪯ is the subgraph relation, we characterize the well‐quasi‐ordered ideals in terms of exluding subgraphs. If⪯is the induced subgraph relation, we present three wellquasi‐ordered ideals. We also construct examples to disprove some of the possible generalizations of our results. The connections between some of our results and digraphs are considered in this paper too. Copyright © 1992 Wiley Periodicals, Inc., A Wiley Company

Publication Source (Journal or Book title)

Journal of Graph Theory

First Page

489

Last Page

502

This document is currently not available here.

Share

COinS