Pages that link to "Item:Q1068110"
From MaRDI portal
The following pages link to Clustering and domination in perfect graphs (Q1068110):
Displayed 32 items.
- An O(\(n\)) time algorithm for maximum matching on cographs (Q685476) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- Finding minimum dominating cycles in permutation graphs (Q1060966) (← links)
- On domination problems for permutation and other graphs (Q1100915) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- An optimal algorithm for finding dominating cycles in circular-arc graphs (Q1186160) (← links)
- The complexity of domination problems in circle graphs (Q1209148) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
- Partial and perfect path covers of cographs (Q1281391) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- A linear time algorithm for the maximum matching problem on cographs (Q1314631) (← links)
- On cocolourings and cochromatic numbers of graphs (Q1315460) (← links)
- Well-covered graphs and extendability (Q1318795) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- A new upper bound for the 0-1 quadratic knapsack problem (Q1806683) (← links)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- A ``maximum node clustering'' problem (Q2479564) (← links)
- A matrix characterization of interval and proper interval graphs (Q2483137) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- Independent Domination in Triangle Graphs (Q3439603) (← links)
- A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650) (← links)
- (Q4488859) (← links)
- (Q5708507) (← links)
- (Q5708621) (← links)
- Total domination in interval graphs (Q5903156) (← links)
- Smallest independent dominating sets in Kronecker products of cycles (Q5951974) (← links)