𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimal Classes of Graphs of Unbounded Clique-Width

✍ Scribed by Vadim V. Lozin

Book ID
105764902
Publisher
Springer
Year
2011
Tongue
English
Weight
296 KB
Volume
15
Category
Article
ISSN
0218-0006

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

New Graph Classes of Bounded Clique-Widt
New Graph Classes of Bounded Clique-Width
✍ Andreas BrandstΓ€dt; Feodor F. Dragan; HoΓ ng-Oanh Le; Raffaele Mosca πŸ“‚ Article πŸ“… 2004 πŸ› Springer 🌐 English βš– 477 KB
Clique-width of partner-limited graphs
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

A class of clique-closed graphs
A class of clique-closed graphs
✍ Chai-Ling Deng; Chong-Keang Lim πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 406 KB

Let K(G) denote the clique graph of a graph G. If q is a class of graphs, then define K(W) to be {K(G): G&}. The class QF is called a clique-closed class if V= K(%'). A graph G is said to have the D,-property if G has both the Helly and'the T,-properties. In this paper, we show that the class of D,