On 𝓕-independence in graphs
Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer (2009)
Discussiones Mathematicae Graph Theory
Similarity:
Let be a set of graphs and for a graph G let and denote the maximum order of an induced subgraph of G which does not contain a graph in as a subgraph and which does not contain a graph in as an induced subgraph, respectively. Lower bounds on and are presented.