scientific article; zbMATH DE number 1248191
From MaRDI portal
Publication:4228229
Recommendations
Cited in
(47)- Local edge domination critical graphs
- Infinite families of circular and Möbius ladders that are total domination game critical
- Total edge critical graphs with leaves
- Connected domination critical graphs.
- Edge lifting and total domination in graphs
- Hamiltonicity of \(3_t\)EC graphs with \(\alpha=\kappa +1\)
- On a conjecture of Murty and Simon on diameter 2-critical graphs
- Total Roman domination edge-critical graphs
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
- A characterization of \(P_5\)-free, diameter-2-critical graphs
- Minimum 2-tuple dominating set of permutation graphs
- The critically index of total domination of a path
- Strongly total domination edge critical graphs
- Some results on domination in graphs
- Connected domination critical graphs with respect to relative complements
- A maximum degree theorem for diameter-2-critical graphs
- A characterization of diameter-2-critical graphs with no antihole of length four
- A characterization of diameter-2-critical graphs whose complements are diamond-free
- scientific article; zbMATH DE number 1472188 (Why is no real title available?)
- A note on total domination edge critical graphs
- 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
- On maximum total domination vertex critical graphs
- scientific article; zbMATH DE number 2187685 (Why is no real title available?)
- scientific article; zbMATH DE number 2188442 (Why is no real title available?)
- scientific article; zbMATH DE number 2188602 (Why is no real title available?)
- All my favorite conjectures are critical
- Total domination critical and stable graphs upon edge removal
- Total domination stable graphs upon edge addition
- Total domination changing and stable graphs upon vertex removal
- Edge-vertex domination on interval graphs
- On a conjecture of Murty and Simon on diameter two critical graphs. II.
- The maximum diameter of total domination edge-critical graphs
- Perfect matchings in total domination critical graphs
- A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
- Minimum 2-tuple dominating set of an interval graph
- Characterize all \(C_5\)-free diameter-2-critical graphs with at least \(\lfloor \frac{ ( n - 1 )^2}{ 4} \rfloor + 1\) edges
- 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
- Properties of total domination edge-critical graphs
- Edge covered critical multigraphs
- A survey of selected recent results on total domination in 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 Q4228229)
