Chordal graphs, interval graphs, and wqo
Guoli Ding · Journal of Graph Theory · 1998
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.