Guoli Ding
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.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Chordal graph, Mathematics, Interval graph, Combinatorics, Indifference graph, Interval (graph theory), Pathwidth, Split graph