The following pages link to Dominating sets in perfect graphs (Q1174132):
Displayed 25 items.
- Total domination and transformation (Q287166) (← links)
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← 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)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
- The complexity of domination problems in circle graphs (Q1209148) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- On the feedback vertex set problem in permutation graphs (Q1338778) (← links)
- Dominations in trapezoid graphs (Q1342259) (← links)
- One-node cutsets and the dominating set polytope (Q1356733) (← links)
- Weighted domination of cocomparability graphs (Q1382270) (← links)
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs (Q1735675) (← 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)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\) (Q2147590) (← links)
- Incomparability graphs of the lattices \(L_{n}\) and \(L_n^{1^2}\) (Q2413370) (← links)
- Some advances on the set covering polyhedron of circulant matrices (Q2636828) (← links)
- On dominating set polyhedra of circular interval graphs (Q2659194) (← links)
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals (Q2980919) (← links)
- Connected domination and steiner set on asteroidal triple-free graphs (Q5060107) (← links)