CHORDAL GRAPHS, INTERVAL-GRAPHS, AND WQO

Authors
DING GL
Citation
Gl. Ding, CHORDAL GRAPHS, INTERVAL-GRAPHS, AND WQO, Journal of graph theory, 28(2), 1998, pp. 105-114
Citations number
5
Categorie Soggetti
Mathematics,Mathematics
Journal title
Journal of graph theory → ACNP
ISSN journal
03649024
Volume
28
Issue
2
Year of publication
1998
Pages
105 - 114
Database
ISI
SICI code
0364-9024(1998)28:2<105:CGIAW>2.0.ZU;2-0
Abstract
Let less than or equal to be the induced-minor relation, It is shown t hat, for every t, all chordal graphs of clique number at most t are we ll-quasi-ordered by less than or equal to. On the other hand, if the b ound on clique number is dropped, even the class of interval graphs is not well-quasi-ordered by less than or equal to. (C) 1998 John Wiley & Sons, Inc.