scientific article; zbMATH DE number 861332
From MaRDI portal
Publication:4871056
zbMath0844.05062MaRDI QIDQ4871056
Publication date: 28 March 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (28)
Independent domination in hereditary classes ⋮ Independent sets of maximum weight in (\(p,q\))-colorable graphs. ⋮ The algorithmic complexity of the minus clique-transversal problem ⋮ Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs ⋮ A sufficient condition to extend polynomial results for the maximum independent set problem ⋮ New results on independent sets in extensions of \(2K_2\)-free graphs ⋮ Clique-transversal number of graphs whose clique-graphs are trees ⋮ New applications of clique separator decomposition for the maximum weight stable set problem ⋮ Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem ⋮ Homothetic polygons and beyond: maximal cliques in intersection graphs ⋮ On the thinness and proper thinness of a graph ⋮ Minimum cost flow problem with conflicts ⋮ Independent domination in finitely defined classes of graphs ⋮ Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time ⋮ An inequality for polymatroid functions and its applications. ⋮ Reconfiguration of cliques in a graph ⋮ Clique problem, cutting plane proofs and communication complexity ⋮ Bounds on the clique-transversal number of regular graphs ⋮ On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem ⋮ Maximum regular induced subgraphs in \(2P_3\)-free graphs ⋮ Stability number in subclasses of \(P_5\)-free graphs ⋮ Independent sets in extensions of 2\(K_{2}\)-free graphs ⋮ Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs ⋮ Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs ⋮ Strong cliques in diamond-free graphs ⋮ Independent sets in \((P_4+P_4\),triangle)-free graphs ⋮ Extension of hereditary classes with substitutions ⋮ On efficient domination for some classes of \(H\)-free bipartite graphs
This page was built for publication:
