Graphs with disjoint 2-dominating sets
From MaRDI portal
Publication:5863482
zbMath1495.05223arXiv2103.03053MaRDI QIDQ5863482
Michael A. Henning, Jerzy Topp
Publication date: 1 June 2022
Full work available at URL: https://arxiv.org/abs/2103.03053
Cites Work
- Unnamed Item
- Disjoint dominating and total dominating sets in graphs
- A characterization of graphs with disjoint dominating and paired-dominating sets
- Remarks about disjoint dominating sets
- Pairs of disjoint dominating sets and the minimum degree of graphs
- Spanning trees with disjoint dominating and 2-dominating sets
- Disjoint dominating and 2-dominating sets in graphs
- On graphs with disjoint dominating and 2-dominating sets
- Partitioning a graph into a dominating set, a total dominating set, and something else
- Total Domination in Graphs
- A characterization of graphs with disjoint total dominating sets
- Bipartite spanning sub(di)graphs induced by 2‐partitions
This page was built for publication: Graphs with disjoint 2-dominating sets