scientific article; zbMATH DE number 861332
From MaRDI portal
Publication:4871056
Recommendations
Cited in
(36)- Cliques, minors and apex graphs
- Independent domination in finitely defined classes of graphs
- An inequality for polymatroid functions and its applications.
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- Maximum weight independent set for claw-free graphs in polynomial time
- Stability number in subclasses of \(P_5\)-free graphs
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
- Extension of hereditary classes with substitutions
- Independent sets of maximum weight in (\(p,q\))-colorable graphs.
- Many cliques with few edges and bounded maximum degree
- Independent sets in \((P_4+P_4\),triangle)-free graphs
- Counting cliques in 1-planar graphs
- New results on independent sets in extensions of \(2K_2\)-free graphs
- On efficient domination for some classes of H-free bipartite graphs
- The algorithmic complexity of the minus clique-transversal problem
- On the thinness and proper thinness of a graph
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
- Reconfiguration of cliques in a graph
- A sufficient condition to extend polynomial results for the maximum independent set problem
- Number of cliques in graphs with a forbidden subdivision
- Clique problem, cutting plane proofs and communication complexity
- Clique-transversal number of graphs whose clique-graphs are trees
- Complexity results on graphs with few cliques
- Strong cliques in diamond-free graphs
- Minimum cost flow problem with conflicts
- The typical structure of graphs with no large cliques
- Maximum regular induced subgraphs in 2P₃-free graphs
- Independent sets of maximum weight beyond claw-free graphs and related problems
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
- Independent domination in hereditary classes
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
- New applications of clique separator decomposition for the maximum weight stable set problem
- Bounds on the clique-transversal number of regular graphs
- On the maximum number of cliques in a graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871056)
