Publication:5387674
From MaRDI portal
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
modular decomposition; maximum weight stable set; structure analysis; monadic second order logic; MWS
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Unnamed Item, Clique-Width for Graph Classes Closed under Complementation, Bounding the clique-width of \(H\)-free split graphs, Weighted independent sets in classes of \(P_6\)-free graphs, Colouring vertices of triangle-free graphs without forests, Labelled induced subgraphs and well-quasi-ordering, Classifying the clique-width of \(H\)-free bipartite graphs, Recent developments on graphs of bounded clique-width, A new characterization of \(P_{6}\)-free graphs, Triangle-free graphs with no six-vertex induced path, Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time, Colouring square-free graphs without long induced paths, Colouring diamond-free graphs, 4-coloring \((P_6, \text{bull})\)-free graphs, Bounding clique-width via perfect graphs, Coloring graphs without short cycles and long induced paths, List coloring in the absence of two subgraphs, The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes, Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy, Bounding Clique-Width via Perfect Graphs, Open Problems on Graph Coloring for Special Graph Classes, Bounding the Clique-Width of H-free Chordal Graphs, Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs, Colouring Vertices of Triangle-Free Graphs, The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs
