𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomial-time recognition of clique-width ≤3 graphs

✍ Scribed by Derek G. Corneil; Michel Habib; Jean-Marc Lanlignel; Bruce Reed; Udi Rotics

Book ID
113564620
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
880 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs of linear clique-width at most 3
Graphs of linear clique-width at most 3
✍ Pinar Heggernes; Daniel Meister; Charis Papadopoulos 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 428 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