| dc.creator | Larrion, F | |
| dc.creator | de Mello, CP | |
| dc.creator | Morgana, A | |
| dc.creator | Neumann-Lara, V | |
| dc.creator | Pizana, MA | |
| dc.date | 2004 | |
| dc.date | MAY 6 | |
| dc.date | 2014-11-13T13:00:14Z | |
| dc.date | 2015-11-26T17:09:38Z | |
| dc.date | 2014-11-13T13:00:14Z | |
| dc.date | 2015-11-26T17:09:38Z | |
| dc.date.accessioned | 2018-03-28T23:58:16Z | |
| dc.date.available | 2018-03-28T23:58:16Z | |
| dc.identifier | Discrete Mathematics. Elsevier Science Bv, v. 282, n. 41699, n. 183, n. 191, 2004. | |
| dc.identifier | 0012-365X | |
| dc.identifier | WOS:000221634100018 | |
| dc.identifier | 10.1016/j.disc.2003.10.023 | |
| dc.identifier | http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/74959 | |
| dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/74959 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/74959 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1280670 | |
| dc.description | The clique graph of a graph G is the intersection graph K(G) of the (maximal) cliques of G. The iterated clique graphs K(n)(G) are defined by K(0)(G) = G and K(i)(G) = K(K(i-1)(G)), i > 0 and K is the clique operator. A cograph is a graph with no induced subgraph isomorphic to P(4). In this article we use the modular decomposition technique to characterize the K-behaviour of cographs and to give some partial results for the larger class of serial (i.e. complement-disconnected) graphs. We prove that a cograph is K-convergent if and only if it is clique-Helly. This characterization leads to a polynomial time algorithm for deciding the K-convergence or K-divergence of any cograph. (C) 2003 Elsevier B.V. All rights reserved. | |
| dc.description | 282 | |
| dc.description | 41699 | |
| dc.description | 183 | |
| dc.description | 191 | |
| dc.language | en | |
| dc.publisher | Elsevier Science Bv | |
| dc.publisher | Amsterdam | |
| dc.publisher | Holanda | |
| dc.relation | Discrete Mathematics | |
| dc.relation | Discret. Math. | |
| dc.rights | fechado | |
| dc.rights | http://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy | |
| dc.source | Web of Science | |
| dc.subject | iterated clique graphs | |
| dc.subject | clique divergence | |
| dc.subject | modular decompositions | |
| dc.subject | cographs | |
| dc.subject | Chordal Graphs | |
| dc.subject | Helly Graphs | |
| dc.subject | Algorithms | |
| dc.subject | Divergent | |
| dc.title | The clique operator on cographs and serial graphs | |
| dc.type | Artículos de revistas | |
