Abstract

Let precedes, equal to 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 by precedes, equal to. On the other hand, if the bound on clique number is dropped, even the class of interval graphs is not well-quasi-ordered by precedes, equal to. © 1998 John Wiley & Sons, Inc. J Graph Theory 28: 105–114, 1998

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call