Pages that link to "Item:Q1169487"
From MaRDI portal
The following pages link to Independent domination in chordal graphs (Q1169487):
Displayed 25 items.
- On approximating the minimum independent dominating set (Q750159) (← links)
- Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- The complexity of domination problems in circle graphs (Q1209148) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Well-covered graphs and extendability (Q1318795) (← links)
- Generating all maximal independent sets on trees in lexicographic order (Q1328528) (← links)
- Weighted domination of cocomparability graphs (Q1382270) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- Roman domination in graphs. (Q1427467) (← links)
- The bottleneck independent domination on the classes of bipartite graphs and block graphs. (Q1429835) (← links)
- Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
- The weighted independent domination problem is NP-complete for chordal graphs (Q1887072) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Improved bottleneck domination algorithms (Q2499580) (← links)
- On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Q2773025) (← links)
- An Analogue of the Shannon Capacity of a Graph (Q3204507) (← links)
- Independent Domination in Triangle Graphs (Q3439603) (← links)
- Convexity in Graphs and Hypergraphs (Q3718757) (← links)