Connected domination critical graphs with cut vertices
From MaRDI portal
Publication:2194530
DOI10.7151/DMGT.2163zbMATH Open1446.05072OpenAlexW2896718858WikidataQ129104678 ScholiaQ129104678MaRDI QIDQ2194530FDOQ2194530
Authors: P. Kaemawichanurat, N. Ananchuen 
Publication date: 26 August 2020
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2163
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cites Work
- On domination critical graphs with cutvertices having connected domination number 3
- Connected domination critical graphs.
- Critical graphs with respect to total domination and connected domination
- A note on connected domination critical graphs
- On 4-\(\gamma_c\)-critical graphs with cut-vertices
- Total edge critical graphs with leaves
Cited In (14)
- Critical graphs with respect to total domination and connected domination
- Some results on the independence number of connected domination critical graphs
- Connected domination critical graphs with a block having maximum number of cut vertices
- On minimum cutsets in independent domination vertex critical graphs
- On 4-\(\gamma_c\)-critical graphs with cut-vertices
- On domination critical graphs with cutvertices having connected domination number 3
- Independence number and connectivity of maximal connected domination vertex critical graphs
- Traceability of connected domination critical graphs
- On connected \((\gamma,k)\)-critical graphs
- Construction of (\(\gamma, k\))-critical graphs
- On connected cutfree domination in graphs
- Title not available (Why is that?)
- A characterization of independent domination critical graphs with a cutvertex
- Connected domination
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)
