Independent domination in hereditary classes
From MaRDI portal
Publication:818132
DOI10.1016/j.tcs.2005.10.049zbMath1086.68059OpenAlexW2092721193MaRDI QIDQ818132
Olga I. Zverovich, Igor Edm. Zverovich
Publication date: 24 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.049
Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (5)
On the computational complexity of the Helly number in the \(P_3\) and related convexities ⋮ Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs ⋮ On a class of graphs between threshold and total domishold graphs ⋮ On the inapproximability of independent domination in \(2P_3\)-free perfect graphs ⋮ Independent Domination in Triangle Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination, independent domination, and duality in strongly chordal graphs
- Dominating sets for split and bipartite graphs
- Weakly triangulated graphs
- Satgraphs and independent domination. I
- The strong perfect graph theorem
- Independent domination in finitely defined classes of graphs
- Locally well-dominated and locally independent well-dominated graphs
- Progress on perfect graphs
- \(r\)-bounded \(k\)-complete bipartite bihypergraphs and generalized split graphs
- A characterization of domination reducible graphs
- Domination in permutation graphs
- On graphs with polynomially solvable maximum-weight clique problem
- A New Algorithm for Generating All the Maximal Independent Sets
- The complexity of theorem-proving procedures
- Bi-induced sub graphs and stability number
This page was built for publication: Independent domination in hereditary classes
