Connected domination critical graphs with cut vertices
From MaRDI portal
Publication:2194530
Recommendations
- On 4-\(\gamma_c\)-critical graphs with cut-vertices
- On domination critical graphs with cutvertices having connected domination number 3
- Connected domination critical graphs with a block having maximum number of cut vertices
- On connected \((\gamma,k)\)-critical graphs
- Traceability of connected domination critical graphs
Cites work
- A note on connected domination critical graphs
- Connected domination critical graphs.
- Critical graphs with respect to total domination and connected domination
- On 4-\(\gamma_c\)-critical graphs with cut-vertices
- On domination critical graphs with cutvertices having connected domination number 3
- Total edge critical graphs with leaves
Cited in
(14)- On minimum cutsets in independent domination vertex critical graphs
- On connected cutfree domination in graphs
- scientific article; zbMATH DE number 824569 (Why is no real title available?)
- On 4-\(\gamma_c\)-critical graphs with cut-vertices
- Critical graphs with respect to total domination and connected domination
- On domination critical graphs with cutvertices having connected domination number 3
- Independence number and connectivity of maximal connected domination vertex critical graphs
- Construction of (\(\gamma, k\))-critical graphs
- Connected domination critical graphs with a block having maximum number of cut vertices
- Connected domination
- A characterization of independent domination critical graphs with a cutvertex
- Traceability of connected domination critical graphs
- On connected \((\gamma,k)\)-critical graphs
- Some results on the independence number of connected domination critical graphs
This page was built for publication: Connected domination critical graphs with cut vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194530)
