Pages that link to "Item:Q4344216"
From MaRDI portal
The following pages link to Bounds related to domination in graphs with minimum degree two (Q4344216):
Displaying 16 items.
- Domination number in graphs with minimum degree two (Q839753) (← links)
- Domination in partitioned graphs with minimum degree two (Q870974) (← links)
- Restricted domination in graphs with minimum degree 2 (Q878627) (← links)
- An upper bound on the domination number of a graph with minimum degree 2 (Q1011694) (← links)
- Restricted total domination in graphs (Q1763333) (← links)
- Relating the size of a connected graph to its total and restricted domination numbers (Q1827789) (← links)
- Girth and total domination in graphs (Q1926051) (← links)
- Domination versus total domination in claw-free cubic graphs (Q2075530) (← links)
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs (Q2257297) (← links)
- Restricted power domination and zero forcing problems (Q2424658) (← links)
- Restricted domination parameters in graphs (Q2467572) (← links)
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles (Q3605160) (← links)
- Graphs with large total domination number (Q4508619) (← links)
- Domination in planar graphs with small diameter* (Q4537553) (← links)
- On restricted domination in graphs (Q5433519) (← links)
- Dominating sets inducing large component in graphs with minimum degree two (Q6133670) (← links)
