Clique-width of partner-limited graphs
β
Jean-Marie Vanherpe
π
Article
π
2004
π
Elsevier Science
π
English
β 371 KB
The clique-width of a graph G is the minimum number of labels that are required for deΓΏning G by an expression based on graph operations using vertex labels. The partner-limited graphs (PL-graphs for short) are deΓΏned to be graphs with a limited number of P4's. We prove that PL-graphs are of bounded