Chordal graphs, interval graphs, and wqo

  • Guoli Ding
  • Published 1998 in Journal of Graph Theory

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 by !. On the other hand, if the bound on clique number is dropped, even the class of interval graphs is not well-quasi-ordered by !. c © 1998 John Wiley & Sons, Inc. J Graph Theory 28: 105–114, 1998 
DOI: 10.1002/(SICI)1097-0118(199806)28:2%3C105::AID-JGT4%3E3.0.CO;2-P

Topics

3 Figures and Tables

Statistics

0102030201520162017
Citations per Year

Citation Velocity: 5

Averaging 5 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics