The following pages link to (Q4163262):
Displayed 24 items.
- Bounds relating generalized domination parameters (Q687110) (← 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)
- A linear algorithm for finding a minimum dominating set in a cactus (Q1078205) (← links)
- An extremal problem for edge domination insensitive graphs (Q1099185) (← links)
- Contributions to the theory of domination, independence and irredundance in graphs (Q1157348) (← links)
- R-domination of block graphs (Q1171499) (← links)
- Chordal graphs and upper irredundance, upper domination and independence (Q1174126) (← links)
- Domatically critical and domatically full graphs (Q1174128) (← links)
- An interpolation theorem for partitions which are indivisible with respect to cohereditary properties (Q1179468) (← links)
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model (Q1195857) (← links)
- The domatic number problem (Q1322260) (← links)
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622) (← links)
- One-node cutsets and the dominating set polytope (Q1356733) (← links)
- On domination and independence numbers of graphs (Q1813991) (← links)
- Critical concepts in domination (Q2277481) (← links)
- On the dominating set polytope (Q2426444) (← 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)
- (Q3926622) (← links)
- (Q3982190) (← links)
- (Q4711958) (← links)
- Total domination in interval graphs (Q5903263) (← links)