Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Recognizing Well Covered Graphs Of Families With Special P4-components|
de Mello C.P.
|Abstract:||A graph G is called well covered if every two maximal independent sets of G have the same number of vertices. In this paper we shall use the modular and primeval decomposition techniques to decide well coveredness of graphs such that, either all their P4-connected components (in short, P4-components) are separable or they belong to well known classes of graphs that, in some local sense, contain few P4's. In particular, we shall consider the class of cographs, P4-reducible, P4-sparse, extended P4-reducible, extended P4-sparse graphs, P4-extendible graphs, P4-lite graphs, and P4-tidy graphs. © 2011 Springer.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.