✦ LIBER ✦

Clique-width of countable graphs: a compactness property

✍ Scribed by Bruno Courcelle

Book ID: 108498115
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 128 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80129-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique-width of countable graphs: a comp

Clique-width of countable graphs: a compactness property

✍ B. Courcelle 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 299 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

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

Minimal Classes of Graphs of Unbounded C

Minimal Classes of Graphs of Unbounded Clique-Width

✍ Vadim V. Lozin 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 296 KB

Constrained-Path Labellings on Graphs of

Constrained-Path Labellings on Graphs of Bounded Clique-Width

✍ Bruno Courcelle; Andrew Twigg 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 961 KB