The clique operator on graphs with few P4's

Authors:
C. P. de Mello;A. Morgana;M. Liverani
Affiliations:
Instituto de Computação, UNICAMP, Brasil;Dipartimento di Matematica, Università di Roma "La Sapienza", Italy;Dipartimento di Matematica, Università Roma Tre, Italy
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 12
Cited 2

Diameters of iterated clique graphs of chordal graphs

Journal of Graph Theory
Clique graphs and Helly graphs

Journal of Combinatorial Theory Series B
On a unique tree representation for P4-extendible graphs

Discrete Applied Mathematics - Special volume: combinatorics and theoretical computer science
A tree representation for P4-sparse graphs

Discrete Applied Mathematics
Convergence of iterated clique graphs

Discrete Mathematics
On extendedP4-reducible and extendedP4-sparse graphs

Theoretical Computer Science
Clique divergent graphs with unbounded sequence of diameters

Discrete Mathematics
Modular decomposition and transitive orientation

Discrete Mathematics - Special issue on partial ordered sets
Locally C6 graphs are clique divergent

Discrete Mathematics
On clique divergent graphs with linear growth

Discrete Mathematics
The icosahedron is clique divergent

Discrete Mathematics
A New Linear Algorithm for Modular Decomposition

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming

On expansive graphs

European Journal of Combinatorics
The clique operator on circular-arc graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

The clique graph of a graph G is the intersection graph K (G) of the (maximal) cliques of G. The iterated clique graphs Kn (G) are defined by KO(G) = G and Ki(G) = K(Ki-1(G)), i 0 and K is the clique operator. In this article we use the modular decomposition technique to characterize the K-behaviour of some classes of graphs with few P4's.These characterizations lead to polynomial time algorithms for deciding the K-convergence or K-divergence of any graph in the class.