✦ LIBER ✦

Graphs of linear clique-width at most 3

✍ Scribed by Pinar Heggernes; Daniel Meister; Charis Papadopoulos

Book ID: 113927456
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 428 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.06.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial-time recognition of clique-wi

Polynomial-time recognition of clique-width ≤3 graphs

✍ Derek G. Corneil; Michel Habib; Jean-Marc Lanlignel; Bruce Reed; Udi Rotics 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 880 KB

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

Clique width of Partner limited graphs

✍ Jean-Marie Vanherpe 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 342 KB

Linear Time Solvable Optimization Proble

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width

✍ B. Courcelle; J. A. Makowsky; U. Rotics 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 150 KB

On powers of graphs of bounded NLC-width

On powers of graphs of bounded NLC-width (clique-width)

✍ Karol Suchan; Ioan Todinca 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 177 KB

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