Pages that link to "Item:Q1169487"

The following pages link to Independent domination in chordal graphs (Q1169487):

Displaying 42 items.

• Roman domination on strongly chordal graphs (Q385486) (← links)
• Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
• Independent dominating set problem revisited (Q476836) (← links)
• On approximating the minimum independent dominating set (Q750159) (← links)
• Mind the independence gap (Q776261) (← 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)
• Laminar structure of ptolemaic graphs with applications (Q1028126) (← 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)
• Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
• On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
• Small \(k\)-pyramids and the complexity of determining \(k\) (Q2253900) (← links)
• Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
• Independent domination versus weighted independent domination (Q2294440) (← links)
• New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
• On the independent dominating set polytope (Q2368719) (← links)
• More results on weighted independent domination (Q2410364) (← links)
• NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
• Improved bottleneck domination algorithms (Q2499580) (← links)
• On the kernelization of split graph problems (Q2636501) (← 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)
• Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
• On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm (Q5247696) (← links)
• Intersection graphs of non-crossing paths (Q6041577) (← links)
• Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
• Weighted domination on cocomparability graphs (Q6487953) (← links)