The following pages link to Dominating Sets in Chordal Graphs (Q3944643):
Displaying 50 items.
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- Optimization problems in multiple subtree graphs (Q531599) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- 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 neighborhood polynomial of chordal graphs (Q832856) (← links)
- Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675) (← links)
- The weighted perfect domination problem (Q912630) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Some remarks on the geodetic number of a graph (Q965962) (← links)
- On the geodetic and geodetic domination numbers of a graph (Q982620) (← 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)
- A width parameter useful for chordal and co-comparability graphs (Q1680525) (← links)
- On total \(f\)-domination: polyhedral and algorithmic results (Q1732100) (← links)
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs (Q1735675) (← 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)
- 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)
- Dominating set of rectangles intersecting a straight line (Q2025079) (← links)
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs (Q2045048) (← links)
- An improved exact algorithm for minimum dominating set in chordal graphs (Q2059888) (← links)
