Title
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
Recommended Citation
Ding, G. (1998). Chordal Graphs, Interval Graphs, and wqo. Journal of Graph Theory, 28 (2), 105-114. https://doi.org/10.1002/(SICI)1097-0118(199806)28:2<105::AID-JGT4>3.0.CO;2-P
COinS