Premium
Graphs omitting sums of complete graphs
Author(s) -
Cherlin Gregory,
Shi Niandong
Publication year - 1997
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199703)24:3<237::aid-jgt5>3.0.co;2-q
Subject(s) - mathematics , countable set , combinatorics , cograph , chordal graph , indifference graph , discrete mathematics , induced subgraph , split graph , graph , 1 planar graph , maximal independent set , pathwidth , line graph , vertex (graph theory)
For every finite m and n there is a finite set { G 1 , …, G l } of countable (m · K n )‐free graphs such that every countable ( m · K n )‐free graph occurs as an induced subgraph of one of the graphs G l © 1997 John Wiley & Sons, Inc.