The clique operator on graphs with few \(P_{4}\)'s (Q2489945)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The clique operator on graphs with few P₄'s |
scientific article; zbMATH DE number 5021044
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The clique operator on graphs with few \(P_{4}\)'s |
scientific article; zbMATH DE number 5021044 |
Statements
The clique operator on graphs with few \(P_{4}\)'s (English)
0 references
28 April 2006
0 references
The authors extend their previous work on iterated clique graphs [Discrete Math. 282, 183--191 (2004; Zbl 1042.05074) and Mat. Contemp. 25, 33--47 (2003; Zbl 1050.05101)] to the class of \(P_4\)-tidy graphs considered by \textit{V. Giakoumakis, F. Roussel} and \textit{H. Thuillier} [Discrete Math. Theor. Comput. Sci. 1, 17--41 (1997; Zbl 0930.05073)].
0 references
clique graph
0 references
clique convergence
0 references
clique divergence
0 references
modular decomposition
0 references
\(P_4\)-tidy graph
0 references
0.7764517068862915
0 references
0.7617368102073669
0 references
0.755213737487793
0 references
