Acyclic total dominating sets in cubic graphs
From MaRDI portal
Publication:5028796
Recommendations
Cites work
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- Acyclic domination
- Acyclic domination on bipartite permutation graphs
- Disjoint independent dominating sets in graphs
- On disjoint maximal independent sets in graphs
- Some remarks on domination
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
- Total domination in graphs
Cited in
(2)
This page was built for publication: Acyclic total dominating sets in cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028796)