Dominating and total dominating partitions in cubic graphs
From MaRDI portal
Publication:657306
DOI10.2478/s11533-011-0014-2zbMath1233.05151OpenAlexW1976691702MaRDI QIDQ657306
Justin Southey, Michael A. Henning
Publication date: 16 January 2012
Published in: Central European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/s11533-011-0014-2
Related Items (5)
Minimal graphs with disjoint dominating and paired-dominating sets ⋮ Partitioning the vertices of a cubic graph into two total dominating sets ⋮ Disjoint dominating and 2-dominating sets in graphs ⋮ Spanning trees with disjoint dominating and 2-dominating sets ⋮ Algorithm and complexity of the two disjoint connected dominating sets problem on trees
Cites Work
- Disjoint dominating and total dominating sets in graphs
- Total domination of graphs and small transversals of hypergraphs
- Total domination in graphs with given girth
- Remarks about disjoint dominating sets
- An independent dominating set in the complement of a minimum dominating set of a tree
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Inverse domination in graphs
- Pairs of disjoint dominating sets and the minimum degree of graphs
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
- Partitioning a graph into a dominating set, a total dominating set, and something else
- Hypergraphs with large transversal number and with edge sizes at least 3
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
- ON THE TWO-COLOURING OF HYPERGRAPHS
- Some remarks on domination
- Approximating theDomatic Number
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Dominating and total dominating partitions in cubic graphs
