✦ LIBER ✦

Chordal bipartite graphs of bounded tree- and clique-width

✍ Scribed by V. Lozin; D. Rautenbach

Book ID: 108113427
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 247 KB
Volume: 283
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.02.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strong clique trees, neighborhood trees,

Strong clique trees, neighborhood trees, and strongly chordal graphs

✍ McKee, Terry A. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 1 views

Maximal complete subgraphs and clique trees are basic to both the theory and applications of chordal graphs. A simple notion of strong clique tree extends this structure to strongly chordal graphs. Replacing maximal complete subgraphs with open or closed vertex neighborhoods discloses new relationsh

On the OBDD size for graphs of bounded t

On the OBDD size for graphs of bounded tree- and clique-width

✍ Klaus Meer; Dieter Rautenbach 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 528 KB

Partitioning Graphs of Bounded Tree-Widt

Partitioning Graphs of Bounded Tree-Width

✍ Guoli Ding; Bogdan Oporowski; Daniel P. Sanders; Dirk Vertigan 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 199 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

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

Counting truth assignments of formulas o

Counting truth assignments of formulas of bounded tree-width or clique-width

✍ E. Fischer; J.A. Makowsky; E.V. Ravve 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 268 KB