Pages that link to "Item:Q4803314"
From MaRDI portal
The following pages link to Minimum independent dominating sets of random cubic graphs (Q4803314):
Displaying 12 items.
- The cook-book approach to the differential equation method (Q465658) (← links)
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596) (← links)
- An upper bound on the domination number of a graph with minimum degree 2 (Q1011694) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- Analysis of greedy algorithms on graphs with bounded degrees (Q1417582) (← links)
- Maximum induced matchings of random cubic graphs (Q1612292) (← links)
- Domination number of cubic graphs with large girth (Q3113283) (← links)
- Small maximal matchings of random cubic graphs (Q3652558) (← links)
- Independent domination in directed graphs (Q4957541) (← links)
- Minimum Power Dominating Sets of Random Cubic Graphs (Q5272639) (← links)
- Domination in Cubic Graphs of Large Girth (Q5302753) (← links)
- Semitotal domination in claw-free cubic graphs (Q5915777) (← links)
