Domination in Cubic Graphs of Large Girth
From MaRDI portal
Cites work
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- An upper bound on the domination number of \(n\)-vertex connected cubic graphs
- Domination in a graph with a 2‐factor
- Domination in graphs of minimum degree at least two and large girth
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Minimum independent dominating sets of random cubic graphs
- On domination in connected cubic graphs
- Paths, Stars and the Number Three
- The dominating number of a random cubic graph
Cited in
(13)- Inequalities relating domination parameters in cubic graphs
- Some remarks on domination in cubic graphs
- Pairs of disjoint dominating sets in connected cubic graphs
- On domination in connected cubic graphs
- Cubic graphs with large ratio of independent domination number to domination number
- Domination number of cubic graphs with large girth
- Domination and total domination in cubic graphs of large girth
- Efficient domination in cubic vertex-transitive graphs
- Relating ordinary and total domination in cubic graphs of large girth
- Partial domination in supercubic graphs
- Best possible upper bounds on the restrained domination number of cubic graphs
- Domination in 4-regular graphs with no induced 4-cycles
- Independent domination in subcubic bipartite graphs of girth at least six
This page was built for publication: Domination in Cubic Graphs of Large Girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5302753)
