Pages that link to "Item:Q687719"
From MaRDI portal
The following pages link to The independent domination number of a cubic 3-connected graph can be much larger than its domination number (Q687719):
Displaying 13 items.
- Cubic graphs with large ratio of independent domination number to domination number (Q295260) (← links)
- Domination versus independent domination in cubic graphs (Q385388) (← links)
- A structural approach for independent domination of regular graphs (Q497353) (← links)
- What is the difference between the domination and independent domination numbers of a cubic graph? (Q804588) (← links)
- On the independent domination number of regular graphs (Q1929752) (← links)
- Independent domination in bipartite cubic graphs (Q2000581) (← links)
- Independent domination in subcubic graphs (Q2075456) (← links)
- An improved upper bound on the independent domination number in cubic graphs of girth at least six (Q2115169) (← links)
- On independent domination in planar cubic graphs (Q2312063) (← links)
- Independent domination in subcubic graphs of girth at least six (Q2411611) (← links)
- Independent Domination in Cubic Graphs (Q3466348) (← links)
- The independent domination numbers of strong product of two cycles (Q5031932) (← links)
- Domination versus independent domination in regular graphs (Q6056756) (← links)