Pages that link to "Item:Q2482352"
From MaRDI portal
The following pages link to Domination in graphs of minimum degree at least two and large girth (Q2482352):
Displaying 25 items.
- A characterization of hypergraphs with large domination number (Q274700) (← links)
- Improved upper bounds on the domination number of graphs with minimum degree at least five (Q292247) (← links)
- Domination and total domination in cubic graphs of large girth (Q400535) (← links)
- Hypergraphs with large domination number and with edge sizes at least three (Q444441) (← links)
- Domination number of graphs without small cycles (Q659744) (← links)
- Independent domination in subcubic bipartite graphs of girth at least six (Q741773) (← links)
- Domination number in graphs with minimum degree two (Q839753) (← links)
- Domination in bipartite graphs (Q998499) (← links)
- On domination in 2-connected cubic graphs (Q1010698) (← links)
- An upper bound on the domination number of \(n\)-vertex connected cubic graphs (Q1011787) (← links)
- Total domination in graphs with given girth (Q1014823) (← links)
- On certain spanning subgraphs of embeddings with applications to domination (Q1044949) (← links)
- A note on graphs with large girth and small minus domination number (Q1283810) (← links)
- Pairs of disjoint dominating sets in connected cubic graphs (Q1926047) (← links)
- A new bound on the domination number of connected cubic graphs (Q2454559) (← links)
- A note on domination, girth and minimum degree (Q2483423) (← links)
- Dominating sets inducing large components (Q2629281) (← links)
- Domination number of graphs with minimum degree five (Q2656332) (← links)
- Domination number of cubic graphs with large girth (Q3113283) (← links)
- Domination in Cubic Graphs of Large Girth (Q5302753) (← links)
- Relating ordinary and total domination in cubic graphs of large girth (Q5419942) (← links)
- Domination in a graph with a 2‐factor (Q5471053) (← links)
- My Favorite Domination Conjectures in Graph Theory Are Bounded (Q5506786) (← links)
- Partial domination in supercubic graphs (Q6080128) (← links)
- Dominating sets inducing large component in graphs with minimum degree two (Q6133670) (← links)
