The following pages link to Dominating Sets in Chordal Graphs (Q3944643):
Displayed 43 items.
- Efficient algorithms for shortest distance queries on special classes of polygons (Q673766) (← links)
- Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
- Dominating sets for split and bipartite graphs (Q794174) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- The weighted perfect domination problem (Q912630) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Counting labelled chordal graphs (Q1062069) (← links)
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
- Clustering and domination in perfect graphs (Q1068110) (← links)
- A linear algorithm for finding a minimum dominating set in a cactus (Q1078205) (← links)
- Some parallel algorithms on interval graphs (Q1098312) (← links)
- On the domatic number of interval graphs (Q1111388) (← links)
- A unified approach to domination problems on interval graphs (Q1111566) (← links)
- Total domination in interval graphs revisited (Q1114413) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
- Total domination in block graphs (Q1124531) (← links)
- R-domination of block graphs (Q1171499) (← links)
- Chordal graphs and upper irredundance, upper domination and independence (Q1174126) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- An optimal algorithm for finding dominating cycles in circular-arc graphs (Q1186160) (← links)
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs (Q1195488) (← 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)
- Real and integer domination in graphs (Q1297432) (← links)
- The \(k\)-neighbor, \(r\)-domination problems on interval graphs (Q1342074) (← links)
- Clique tree generalization and new subclasses of chordal graphs (Q1348383) (← links)
- The diversity of domination (Q1356420) (← links)
- Defending the Roman Empire from multiple attacks (Q1408869) (← links)
- Defending the Roman Empire---a new strategy (Q1810648) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- The algorithmic complexity of minus domination in graphs (Q1917346) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Shiftable intervals (Q2480206) (← links)
- Two algorithms for determining a minimum independent dominating set (Q3319782) (← links)
- On the Algorithmic Complexity of Total Domination (Q3696538) (← links)
- The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs (Q3697054) (← links)
- A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees (Q3773922) (← links)
- Dominating cliques in graphs (Q5896554) (← links)
- Total domination in interval graphs (Q5903156) (← links)
- Dominating cliques in graphs (Q5925264) (← links)