Pages that link to "Item:Q1011787"
From MaRDI portal
The following pages link to An upper bound on the domination number of \(n\)-vertex connected cubic graphs (Q1011787):
Displaying 16 items.
- Improved upper bounds on the domination number of graphs with minimum degree at least five (Q292247) (← links)
- Domination of maximal \(K_4\)-minor free graphs and maximal \(K_{2, 3}\)-minor free graphs, and disproofs of two conjectures on planar graphs (Q494435) (← links)
- On domination in 2-connected cubic graphs (Q1010698) (← links)
- On certain spanning subgraphs of embeddings with applications to domination (Q1044949) (← links)
- An improved upper bound on the total restrained domination number in cubic graphs (Q1926030) (← links)
- Pairs of disjoint dominating sets in connected cubic graphs (Q1926047) (← links)
- Decreasing the maximum degree of a graph (Q2166269) (← links)
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- A new bound on the domination number of connected cubic graphs (Q2454559) (← links)
- Domination number of graphs with minimum degree five (Q2656332) (← links)
- Domination number of cubic graphs with large girth (Q3113283) (← links)
- A NOT ON DOMINATING SET WITH MAPLE (Q3623269) (← links)
- Graph coloring approach with new upper bounds for the chromatic number: team building application (Q4611483) (← links)
- Domination in Cubic Graphs of Large Girth (Q5302753) (← links)
- Domination in a graph with a 2‐factor (Q5471053) (← links)
- Partial domination in supercubic graphs (Q6080128) (← links)
