Critical graphs with respect to total domination and connected domination
From MaRDI portal
Publication:2820189
Recommendations
Cited in
(19)- The connectivity of domination dot-critical graphs with no critical vertices
- scientific article; zbMATH DE number 6464011 (Why is no real title available?)
- scientific article; zbMATH DE number 881277 (Why is no real title available?)
- On global domination critical graphs
- Connected domination critical graphs with cut vertices
- scientific article; zbMATH DE number 1187326 (Why is no real title available?)
- On the total domination critical graphs
- scientific article; zbMATH DE number 7034398 (Why is no real title available?)
- 2.5-connectivity: unique components, critical graphs, and applications
- Matching properties in connected domination critical graphs
- Disconnected \(g_c\)-critical graphs
- A generalization of domination critical graphs
- On the existence problem of the total domination vertex critical graphs
- scientific article; zbMATH DE number 2084268 (Why is no real title available?)
- Connected domination
- On total domination vertex critical graphs of high connectivity
- Critical graphs with connected complements
- Some results on the independence number of connected domination critical graphs
- On an open problem concerning total domination critical graphs
This page was built for publication: Critical graphs with respect to total domination and connected domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820189)