Independent domination in chordal graphs
From MaRDI portal
Publication:1169487
DOI10.1016/0167-6377(82)90015-3zbMath0495.05053MaRDI QIDQ1169487
Publication date: 1982
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(82)90015-3
90C10: Integer programming
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
On approximating the minimum independent dominating set, Domination, independent domination, and duality in strongly chordal graphs, Bibliography on domination in graphs and some basic definitions of domination parameters, Counting the number of independent sets in chordal graphs, Approximability results for the maximum and minimum maximal induced matching problems, On the inapproximability of independent domination in \(2P_3\)-free perfect graphs, Dominating sets in perfect graphs, Permutation graphs: Connected domination and Steiner trees, The complexity of domination problems in circle graphs, On the algorithmic complexity of twelve covering and independence parameters of graphs, Well-covered graphs and extendability, Generating all maximal independent sets on trees in lexicographic order, Weighted domination of cocomparability graphs, Independent domination in finitely defined classes of graphs, Roman domination in graphs., The bottleneck independent domination on the classes of bipartite graphs and block graphs., Independent sets in extensions of 2\(K_{2}\)-free graphs, The weighted independent domination problem is NP-complete for chordal graphs, On the independent dominating set polytope, NP-hard graph problems and boundary classes of graphs, Improved bottleneck domination algorithms, On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem, An Analogue of the Shannon Capacity of a Graph, Independent Domination in Triangle Graphs, Convexity in Graphs and Hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination, independent domination, and duality in strongly chordal graphs
- A linear algorithm for the domination number of a tree
- Optimum domination in weighted trees
- Triangulated graphs and the elimination process
- Graph-theoretic parameters concerning domination, independence, and irredundance
- R -Domination in Graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Towards a theory of domination in graphs
