On -independence in graphs
Discussiones Mathematicae. Graph Theory, Tome 29 (2009) no. 2, pp. 377-383
Voir la notice de l'article provenant de la source Library of Science
Let be a set of graphs and for a graph G let α_(G) and α*_(G) 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 α_(G) and α*_(G) are presented.
Keywords:
independence, complexity, probabilistic method
@article{DMGT_2009_29_2_a11,
author = {G\"oring, Frank and Harant, Jochen and Rautenbach, Dieter and Schiermeyer, Ingo},
title = {On -independence in graphs},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {377--383},
publisher = {mathdoc},
volume = {29},
number = {2},
year = {2009},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2009_29_2_a11/}
}
TY - JOUR AU - Göring, Frank AU - Harant, Jochen AU - Rautenbach, Dieter AU - Schiermeyer, Ingo TI - On -independence in graphs JO - Discussiones Mathematicae. Graph Theory PY - 2009 SP - 377 EP - 383 VL - 29 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2009_29_2_a11/ LA - en ID - DMGT_2009_29_2_a11 ER -
Göring, Frank; Harant, Jochen; Rautenbach, Dieter; Schiermeyer, Ingo. On -independence in graphs. Discussiones Mathematicae. Graph Theory, Tome 29 (2009) no. 2, pp. 377-383. http://geodesic.mathdoc.fr/item/DMGT_2009_29_2_a11/