Artículos de revistas
Recognizing Well Covered Graphs of Families with Special P (4)-Components
Registro en:
Graphs And Combinatorics. Springer Japan Kk, v. 29, n. 3, n. 553, n. 567, 2013.
0911-0119
WOS:000318875700021
10.1007/s00373-011-1123-1
Autor
Klein, S
de Mello, CP
Morgana, A
Institución
Resumen
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) 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 P (4)-connected components (in short, P (4)-components) are separable or they belong to well known classes of graphs that, in some local sense, contain few P (4)'s. In particular, we shall consider the class of cographs, P (4)-reducible, P (4)-sparse, extended P (4)-reducible, extended P (4)-sparse graphs, P (4)-extendible graphs, P (4)-lite graphs, and P (4)-tidy graphs. 29 3 553 567 Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Fundação de Amparo à Pesquisa do Estado do Rio de Janeiro (FAPERJ) Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)