A characterization of graphs with disjoint total dominating sets
From MaRDI portal
Publication:5225045
DOI10.26493/1855-3974.1525.7f3zbMath1416.05210OpenAlexW2912827914WikidataQ128457169 ScholiaQ128457169MaRDI QIDQ5225045
Michael A. Henning, Iztok Peterin
Publication date: 25 July 2019
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.1525.7f3
Related Items (3)
Graphs with disjoint 2-dominating sets ⋮ Self-stabilizing algorithm for two disjoint minimal dominating sets ⋮ Disjoint total dominating sets in near‐triangulations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Disjoint dominating and total dominating sets in graphs
- A characterization of graphs with disjoint dominating and paired-dominating sets
- A survey of selected recent results on total domination in graphs
- Partitioning the vertices of a cubic graph into two total dominating sets
- On coupon colorings of graphs
- A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
- Total domination in graphs
- Total Domination in Graphs
- Partitioning the Vertices of a Graph into Two Total Dominating Sets
This page was built for publication: A characterization of graphs with disjoint total dominating sets