Pages that link to "Item:Q5471053"
From MaRDI portal
The following pages link to Domination in a graph with a 2‐factor (Q5471053):
Displaying 8 items.
- Domination in bipartite graphs (Q998499) (← links)
- An upper bound on the domination number of \(n\)-vertex connected cubic graphs (Q1011787) (← links)
- On certain spanning subgraphs of embeddings with applications to domination (Q1044949) (← links)
- Pairs of disjoint dominating sets in connected cubic graphs (Q1926047) (← links)
- Domination in graphs of minimum degree at least two and large girth (Q2482352) (← links)
- On domination in connected cubic graphs (Q2576833) (← links)
- Domination number of cubic graphs with large girth (Q3113283) (← links)
- Domination in Cubic Graphs of Large Girth (Q5302753) (← links)
