Forbidden triples generating a finite family of graphs
Time
2013.3.11 9:00am
Venue
S1013
Abstract
We consider the problem of determining those triples {F1,F2,F3} of graphs for which the family of k-connected {F1,F2,F3}-free graphs is a finite family.
