Pairs of disjoint dominating sets in connected cubic graphs
From MaRDI portal
Publication:1926047
DOI10.1007/s00373-011-1050-1zbMath1256.05174OpenAlexW2033290650MaRDI QIDQ1926047
Christian Löwenstein, Dieter Rautenbach
Publication date: 27 December 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1050-1
cubic graphsdomination numberdominating setsdomatic numberinverse dominationdisjoint domination number
Related Items (2)
Improved upper bounds on the domination number of graphs with minimum degree at least five ⋮ A note on non-dominating set partitions in graphs
Cites Work
- An upper bound on the domination number of \(n\)-vertex connected cubic graphs
- Remarks about disjoint dominating sets
- Inverse domination in graphs
- Pairs of disjoint dominating sets and the minimum degree of graphs
- Domination in graphs of minimum degree at least two and large girth
- On domination in connected cubic graphs
- Domination number of cubic graphs with large girth
- Domination in graphs with minimum degree two
- Paths, Stars and the Number Three
- Approximating theDomatic Number
- Domination in Cubic Graphs of Large Girth
- Domination in a graph with a 2‐factor
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Pairs of disjoint dominating sets in connected cubic graphs
