A characterization of graphs with disjoint total dominating sets
From MaRDI portal
Publication:5225045
DOI10.26493/1855-3974.1525.7F3zbMATH Open1416.05210OpenAlexW2912827914WikidataQ128457169 ScholiaQ128457169MaRDI QIDQ5225045FDOQ5225045
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total domination in graphs
- Total Domination in Graphs
- A survey of selected recent results on total domination in graphs
- Disjoint dominating and total dominating sets in graphs
- A characterization of graphs with disjoint dominating and paired-dominating sets
- On coupon colorings of graphs
- A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
- On the total domatic number of regular graphs
- Partitioning the vertices of a cubic graph into two total dominating sets
- Partitioning the Vertices of a Graph into Two Total Dominating Sets
Cited In (7)
- Disjoint total dominating sets in near‐triangulations
- Graphs with disjoint 2-dominating sets
- A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
- Self-stabilizing algorithm for two disjoint minimal dominating sets
- A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
- Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
- Title not available (Why is that?)
This page was built for publication: A characterization of graphs with disjoint total dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225045)
