Independent domination in finitely defined classes of graphs
From MaRDI portal
Recommendations
Cites work
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- A nice class for the vertex packing problem
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Bipartite graphs without a skew star
- Domination in convex and chordal bipartite graphs
- Domination on Cocomparability Graphs
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Handle-rewriting hypergraph grammars
- scientific article; zbMATH DE number 3648727 (Why is no real title available?)
- scientific article; zbMATH DE number 3889566 (Why is no real title available?)
- scientific article; zbMATH DE number 861332 (Why is no real title available?)
- scientific article; zbMATH DE number 2191997 (Why is no real title available?)
- Independent domination in chordal graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Modular decomposition and transitive orientation
- On domination problems for permutation and other graphs
- On graphs with polynomially solvable maximum-weight clique problem
- On maximal independent sets of vertices in claw-free graphs
- On semi-\(P_ 4\)-sparse graphs
- On the clique-width of graph with few \(P_{4}\)'s
- On the clique-width of some perfect graph classes
- On the vertex packing problem
- Some classes of perfectly orderable graphs
- Upper bounds to the clique width of graphs
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
Cited in
(27)- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Domination problems with no conflicts
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- Chordal bipartite graphs of bounded tree- and clique-width
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
- Independent sets with domination constraints
- On the complexity of independent dominating set with obligations in graphs
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
- Independent domination in outerplanar graphs
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- Independent domination versus weighted independent domination
- The computational complexity of three graph problems for instances with bounded minors of constraint matrices
- On the independent dominating set polytope
- More results on weighted independent domination
- NP-hard graph problems and boundary classes of graphs
- Independent perfect domination sets in Cayley graphs
- On independence domination
- Tree-Width and Optimization in Bounded Degree Graphs
- Boundary Classes of Planar Graphs
- scientific article; zbMATH DE number 468640 (Why is no real title available?)
- Independent dominating sets in triangle-free graphs
- Independent domination in directed graphs
- Weighted efficient domination for P₈-free bipartite graphs in polynomial time
- Mind the independence gap
- Satgraphs and independent domination. I
- Independent domination in hereditary classes
This page was built for publication: Independent domination in finitely defined classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399990)
