| dc.creator | Klein S. | |
| dc.creator | de Mello C.P. | |
| dc.creator | Morgana A. | |
| dc.date | 2013 | |
| dc.date | 2015-06-25T19:17:39Z | |
| dc.date | 2015-11-26T15:15:30Z | |
| dc.date | 2015-06-25T19:17:39Z | |
| dc.date | 2015-11-26T15:15:30Z | |
| dc.date.accessioned | 2018-03-28T22:25:18Z | |
| dc.date.available | 2018-03-28T22:25:18Z | |
| dc.identifier | | |
| dc.identifier | Graphs And Combinatorics. , v. 29, n. 3, p. 553 - 567, 2013. | |
| dc.identifier | 9110119 | |
| dc.identifier | 10.1007/s00373-011-1123-1 | |
| dc.identifier | http://www.scopus.com/inward/record.url?eid=2-s2.0-84877615612&partnerID=40&md5=a9cb724d3e54f10e58f1969e7ebaeaae | |
| dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/89584 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/89584 | |
| dc.identifier | 2-s2.0-84877615612 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1259028 | |
| 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 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. | |
| dc.description | 29 | |
| dc.description | 3 | |
| dc.description | 553 | |
| dc.description | 567 | |
| dc.description | Baumann, S., (1996) A linear algorithm for the homogeneous decomposition of graphs, , Report No. M-9615, Zentrum Mathematik, Technische Universität München | |
| dc.description | Caro, Y., Subdivisions, parity and well-covered graphs (1997) J. Graph Theory, 25, pp. 85-94 | |
| dc.description | Caro, Y., Sebö, A., Tarsi, M., Recognizing greedy structures (1996) J. Algorithms, 20, pp. 137-156 | |
| dc.description | Chvátal, V., Slater, P.J., A note on well-covered graphs (1993) Ann. Discrete Math., 55, pp. 179-182 | |
| dc.description | Corneil, D.G., Lerchs, H., Stewart Burlingham, L., Complement reducible graphs (1981) Discrete Appl. Math., 3, pp. 163-174 | |
| dc.description | Corneil, D.G., Perl, Y., Stewart, L.K., Cographs: recognition, applications and algorithms (1984) Congressus Numerantium, 43, pp. 249-258 | |
| dc.description | Dean, N., Zito, J., Well covered graphs and extendability (1994) Discrete Math., 126, pp. 67-80 | |
| dc.description | Fradkin, A.O., On the well-coveredness of Cartesian products of graphs (2009) Discrete Math., 309 (1), pp. 238-246 | |
| dc.description | Finbow, A., Hartnell, B., Nowakowski, R., A characterization of well-covered graphs of girth 5 or greater (1993) J. Combin. Theory B, 57, pp. 44-68 | |
| dc.description | Giakoumakis, V., Vanherpe, J.-M., On extended P4-reducible and extended P4-sparse graphs (1997) Theor. Comput. Sci., 180, pp. 269-286 | |
| dc.description | Giakoumakis, V., Roussel, F., Thuillier, H., On P4-tidy graphs (1997) Discrete Math. Theor. Comput. Sci., 1, pp. 17-41 | |
| dc.description | Hammer, P.L., Simeone, B., The splittance of a graph (1981) Combinatorica, 1, pp. 275-284 | |
| dc.description | Hóang, C., (1985) Doctoral Dissertation, , McGill University, Montreal | |
| dc.description | Jamison, B., Olariu, S., A new class of brittle graphs (1989) Stud. Appl. Math., 81, pp. 89-92 | |
| dc.description | Jamison, B., Olariu, S., P4-reducible graphs, a class of uniquely tree representable graphs (1989) Stud. Appl. Math., 81, pp. 79-87 | |
| dc.description | Jamison, B., Olariu, S., On a unique tree representation for P4-extendible graphs (1991) Discrete Appl. Math., 34, pp. 151-164 | |
| dc.description | Jamison, B., Olariu, S., A unique tree representation for P4-sparse graphs (1992) Discrete Appl. Math., 35, pp. 115-129 | |
| dc.description | Jamison, B., Olariu, S., p-Components and the homogeneous decomposition of graphs (1995) SIAM J. Discrete Math., 8, pp. 448-463 | |
| dc.description | McConnell, R.M., Spinrad, J.P., Modular decomposition and transitive orientation (1999) Discrete Math., 201, pp. 189-241 | |
| dc.description | Prisner, B., Topp, J., Vestergaard, P.D., Well covered simplicial, chordal, and circular arc graphs (1996) J. Graph Theory, 21 (2), pp. 113-119 | |
| dc.description | Plummer, M.D., Some covering concepts in graphs (1970) J. Combin. Theory, 8, pp. 91-98 | |
| dc.description | Plummer, M.D., Well covered graphs: a survey (1993) Quaestiones Math., 16, pp. 253-287 | |
| dc.description | Randerath, B., Vestergaard, P.D., Well covered graphs and factors (2006) Discrete Appl. Math., 154, pp. 1416-1428 | |
| dc.description | Sankaranarayana, R.S., Stewart, L.K., Complexity results for well-covered graphs (1992) Networks, 22, pp. 247-262 | |
| dc.description | Tankus, D., Tarsi, M., The structure of well covered graphs and the complexity of their recognition problems (1997) J. Combin. Theory B, 69, pp. 230-233 | |
| dc.description | Tedder, M., Corneil, D.G., Habib, M., Paul, C., (2007) Simple, linear-time modular decomposition, , CoRR abs/0710. 3901 | |
| dc.language | en | |
| dc.publisher | | |
| dc.relation | Graphs and Combinatorics | |
| dc.rights | fechado | |
| dc.source | Scopus | |
| dc.title | Recognizing Well Covered Graphs Of Families With Special P4-components | |
| dc.type | Artículos de revistas | |
