scientific article; zbMATH DE number 1472188
From MaRDI portal
Recommendations
Cited in
(20)- Connected domination critical graphs.
- On a conjecture of Murty and Simon on diameter 2-critical graphs
- Minimum 2-tuple dominating set of permutation graphs
- The critically index of total domination of a path
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- Total domination edge critical graphs with total domination number three and many dominating pairs
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs
- Total Roman domination edge-supercritical and edge-removal-supercritical graphs
- On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs
- scientific article; zbMATH DE number 2188602 (Why is no real title available?)
- All my favorite conjectures are critical
- Edge-vertex domination on interval graphs
- On a conjecture of Murty and Simon on diameter two critical graphs. II.
- A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
- Minimum 2-tuple dominating set of an interval graph
- Notes on double Roman domination edge critical graphs
- Computation of minimum d-hop connected dominating set of trees in O(n) time
- An optimal algorithm for computing minimum k-hop dominating set of permutation graphs
- Minimum vertex-edge dominating set of permutation graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4489243)
