scientific article; zbMATH DE number 5279372

zbMath1153.05040MaRDI QIDQ5387674

Tilo Klembt, Suhail Mahfud, Andreas Brandstädt

Publication date: 27 May 2008

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/82/showToc.html

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

zbMATH Keywords

modular decompositionmaximum weight stable setstructure analysismonadic second order logicMWS

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (30)

Weighted independent sets in classes of \(P_6\)-free graphs ⋮ Triangle-free graphs with no six-vertex induced path ⋮ The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs ⋮ List coloring in the absence of two subgraphs ⋮ Colouring diamond-free graphs ⋮ The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes ⋮ 4-coloring \((P_6, \text{bull})\)-free graphs ⋮ Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy ⋮ Bounding the Clique-Width of H-free Chordal Graphs ⋮ Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs ⋮ Labelled induced subgraphs and well-quasi-ordering ⋮ On the computational complexity of the bipartizing matching problem ⋮ Bounding the mim‐width of hereditary graph classes ⋮ Clique‐width: Harnessing the power of atoms ⋮ Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time ⋮ Bounding clique-width via perfect graphs ⋮ Clique-Width for Graph Classes Closed under Complementation ⋮ Classifying the clique-width of \(H\)-free bipartite graphs ⋮ Coloring graphs without short cycles and long induced paths ⋮ Bounding the Mim-Width of Hereditary Graph Classes. ⋮ Recent developments on graphs of bounded clique-width ⋮ A new characterization of \(P_{6}\)-free graphs ⋮ Colouring Vertices of Triangle-Free Graphs ⋮ Bounding Clique-Width via Perfect Graphs ⋮ Bounding the clique-width of \(H\)-free split graphs ⋮ Unnamed Item ⋮ Open Problems on Graph Coloring for Special Graph Classes ⋮ Colouring vertices of triangle-free graphs without forests ⋮ Colouring square-free graphs without long induced paths ⋮ Optimal centrality computations within bounded clique-width graphs

This page was built for publication: