The diameter of domination k‐critical graphs
From MaRDI portal
Publication:4312249
Recommendations
Cited in
(36)- Local edge domination critical graphs
- Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\)
- Changing and unchanging domination: A classification
- Total domination stability in graphs
- A characterization of domination weak bicritical graphs with large diameter
- On the diameter of Kronecker graphs
- The diameter of total domination vertex critical graphs
- Upper bound on the diameter of a domination dot-critical graph
- A characterization of \(3\)-\(\gamma\)-critical graphs which are not bicritical
- Upper bounds on the diameter of domination dot-critical graphs with given connectivity
- Distance domination-critical graphs
- Changing and unchanging of the domination number of a graph
- Bicritical domination
- Domination stability in graphs
- Upper bound on the diameter of a total domination vertex critical graph.
- The diameter of connected domination critical graphs.
- On the diameter of domination bicritical graphs
- Bicritical domination and double coalescence of graphs
- scientific article; zbMATH DE number 6096635 (Why is no real title available?)
- On the total domination critical graphs
- The diameter of paired-domination vertex critical graphs
- On the diameter of dot-critical graphs
- Constructing connected bicritical graphs with edge-connectivity 2
- scientific article; zbMATH DE number 540106 (Why is no real title available?)
- Note: The diameter of edge domination critical graphs
- scientific article; zbMATH DE number 1556733 (Why is no real title available?)
- Vertex domination‐critical graphs
- On a family of 4-critical graphs with diameter three.
- Paired domination stability in graphs
- Domatically perfect graphs
- Complementary total domination in graphs
- Some notes on domination edge critical graphs
- The maximum diameter of total domination edge-critical graphs
- Critical aspects in broadcast domination
- Properties of total domination edge-critical graphs
- On an open problem concerning total domination critical graphs
This page was built for publication: The diameter of domination k‐critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4312249)