Chordal Graphs, Interval Graphs, and wqo

Document Type

Article

Publication Date

1-1-1998

Abstract

Let ≤ be the induced-minor relation. It is shown that, for every t, all chordal graphs of clique number at most t are well-quasi-ordered ≤. On the other hand, if the bound on clique number is dropped, even the class of interval graphs is not well-quasi-ordered by ≤. © 1998 John Wiley & Sons, Inc. J Graph Theory 28: 105-114, 1998.

Publication Source (Journal or Book title)

Journal of Graph Theory

First Page

105

Last Page

114

This document is currently not available here.

Share

COinS