scientific article; zbMATH DE number 5053288

zbMath1102.68098MaRDI QIDQ5487903

Dieter Rautenbach, Vadim V. Lozin

Publication date: 13 September 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmic graph theory

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (19)

The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring ⋮ MSOL partitioning problems on graphs of bounded treewidth and clique-width ⋮ Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs ⋮ Clique‐width: Harnessing the power of atoms ⋮ Graph classes with and without powers of bounded clique-width ⋮ Bounding clique-width via perfect graphs ⋮ Tree-Width and Optimization in Bounded Degree Graphs ⋮ Clique-Width for Graph Classes Closed under Complementation ⋮ Classifying the clique-width of \(H\)-free bipartite graphs ⋮ A new graph construction of unbounded clique-width ⋮ On the complexity of the identifiable subgraph problem ⋮ Recent developments on graphs of bounded clique-width ⋮ Bounding Clique-Width via Perfect Graphs ⋮ Bounding the clique-width of \(H\)-free split graphs ⋮ Unnamed Item ⋮ Volume computation for sparse Boolean quadric relaxations ⋮ Dominating Induced Matchings ⋮ Colouring square-free graphs without long induced paths ⋮ On efficient domination for some classes of \(H\)-free bipartite graphs

This page was built for publication: