| dc.creator | Klein, S | |
| dc.creator | de Mello, CP | |
| dc.creator | Morgana, A | |
| dc.date | 2013 | |
| dc.date | MAY | |
| dc.date | 2014-08-01T18:33:16Z | |
| dc.date | 2015-11-26T18:01:44Z | |
| dc.date | 2014-08-01T18:33:16Z | |
| dc.date | 2015-11-26T18:01:44Z | |
| dc.date.accessioned | 2018-03-29T00:43:21Z | |
| dc.date.available | 2018-03-29T00:43:21Z | |
| dc.identifier | Graphs And Combinatorics. Springer Japan Kk, v. 29, n. 3, n. 553, n. 567, 2013. | |
| dc.identifier | 0911-0119 | |
| dc.identifier | WOS:000318875700021 | |
| dc.identifier | 10.1007/s00373-011-1123-1 | |
| dc.identifier | http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/80647 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/80647 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1292057 | |
| dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
| dc.description | 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. | |
| dc.description | 29 | |
| dc.description | 3 | |
| dc.description | 553 | |
| dc.description | 567 | |
| dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
| dc.description | Fundação de Amparo à Pesquisa do Estado do Rio de Janeiro (FAPERJ) | |
| dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
| dc.language | en | |
| dc.publisher | Springer Japan Kk | |
| dc.publisher | Tokyo | |
| dc.publisher | Japão | |
| dc.relation | Graphs And Combinatorics | |
| dc.relation | Graphs Comb. | |
| dc.rights | fechado | |
| dc.rights | http://www.springer.com/open+access/authors+rights?SGWID=0-176704-12-683201-0 | |
| dc.source | Web of Science | |
| dc.subject | Well covered graphs | |
| dc.subject | Graphs with few P-4's | |
| dc.subject | Modular decomposition | |
| dc.subject | Primeval decomposition | |
| dc.subject | Tree-representation | |
| dc.subject | Decomposition | |
| dc.subject | Complexity | |
| dc.title | Recognizing Well Covered Graphs of Families with Special P (4)-Components | |
| dc.type | Artículos de revistas | |
