The following pages link to (Q4029974):
Displaying 23 items.
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Some variations of perfect graphs (Q726645) (← links)
- Distance irredundance and connected domination numbers of a graph (Q860459) (← links)
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree (Q894482) (← links)
- The diversity of domination (Q1356420) (← links)
- On connected \(k\)-domination numbers of graphs. (Q1421532) (← links)
- Packing in trees (Q1584274) (← links)
- An algorithm to find two distance domination parameters in a graph (Q1917347) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Distributed distance domination in graphs with no \(K_{2,t}\)-minor (Q2143127) (← links)
- Some new results on distance \(k\)-domination in graphs (Q2248720) (← links)
- Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
- Distance domination in graphs with given minimum and maximum degree (Q2410104) (← links)
- Strong non split r-domination number of a graph (Q2839235) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- On the Universality of Small-World Graphs (Q3438954) (← links)
- The ratio of the distance irredundance and domination numbers of a graph (Q4277983) (← links)
- (Q5009468) (← links)
- An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774) (← links)
- Total $k$-distance domination critical graphs (Q5134449) (← links)
- Approximating the Spanning k-Tree Forest Problem (Q5321721) (← links)
- (Q5472338) (← links)
- An efficient algorithm for distance total domination in block graphs (Q5963627) (← links)
