✦ LIBER ✦

New Graph Classes of Bounded Clique-Width

✍ Scribed by Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Raffaele Mosca

Book ID: 105914762
Publisher: Springer
Year: 2004
Tongue: English
Weight: 477 KB
Volume: 38
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-004-1154-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Chordal bipartite graphs of bounded tree

Chordal bipartite graphs of bounded tree- and clique-width

✍ V. Lozin; D. Rautenbach 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 247 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