Total Domination Edge Critical Graphs with Maximum Diameter
From MaRDI portal
Recommendations
Cited in
(24)- Total edge critical graphs with leaves
- Edge lifting and total domination in graphs
- Hamiltonicity of \(3_t\)EC graphs with \(\alpha=\kappa +1\)
- Minimum 2-tuple dominating set of permutation graphs
- scientific article; zbMATH DE number 2024676 (Why is no real title available?)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- On a family of 4-critical graphs with diameter three.
- 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
- scientific article; zbMATH DE number 2197907 (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
- The maximum diameter of total domination edge-critical graphs
- Perfect matchings in total domination critical graphs
- Minimum 2-tuple dominating set of an interval graph
- 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
- On the diameter of total domination vertex-critical graphs
- Properties of total domination edge-critical graphs
- A survey of selected recent results on total domination in graphs
This page was built for publication: Total Domination Edge Critical Graphs with Maximum Diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542867)
