Pages that link to "Item:Q1010698"
From MaRDI portal
The following pages link to On domination in 2-connected cubic graphs (Q1010698):
Displaying 11 items.
- 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)
- A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs (Q998464) (← links)
- An upper bound on the domination number of \(n\)-vertex connected cubic graphs (Q1011787) (← links)
- Domination versus edge domination (Q2197443) (← links)
- Vertex-edge domination in cubic graphs (Q2198396) (← links)
- A new bound on the domination number of connected cubic graphs (Q2454559) (← links)
- Domination in graphs of minimum degree at least two and large girth (Q2482352) (← links)
- On domination in connected cubic graphs (Q2576833) (← links)
- A NOT ON DOMINATING SET WITH MAPLE (Q3623269) (← links)
- Domination in a graph with a 2‐factor (Q5471053) (← links)
- Best possible upper bounds on the restrained domination number of cubic graphs (Q6565811) (← links)