ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
Janos A. Makowsky, Udi Rotics · International Journal of Foundations of Computer Science · 1999
Babel and Olariu (1995) introduced the class of (q, t) graphs in which every set of q vertices has at most t distinct induced P4s. Graphs of clique-width at most k were introduced by Courcelle, Engelfriet and Rozenberg (1993) as graphs which can be defined by k-expressions based on graph operations which use k vertex labels. In this paper we study the clique–width of the (q, t) graphs, for almost all possible combinations of q and t. On one hand we show that every (q, q - 3) graph for q ≥ 7, has clique–width ≤ q and a q–expression defining it can be obtained in linear time. On the other hand we show that the class of (q, q - 3) graphs for 4 ≤ q ≤ 6 and the class of (q, q - 1) graphs for q ≥ 4 are not of bounded clique-width.