Independent domination bicritical graphs
From MaRDI portal
Publication:4622631
Recommendations
Cites work
- scientific article; zbMATH DE number 6096635 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Bicritical domination
- Characteristics of \((\gamma,3)\)-critical graphs
- Constructing connected bicritical graphs with edge-connectivity 2
- Construction of (\(\gamma, k\))-critical graphs
- Independent domination bicritical graphs
- Independent domination in graphs: A survey and recent results
- On connected \((\gamma,k)\)-critical graphs
- On the diameter of domination bicritical graphs
- Vertex domination‐critical graphs
Cited in
(7)- Independent domination bicritical graphs
- On \(i^{-}\)-ER-critical graphs
- Strongly \(i\)-bicritical graphs
- On \(i\)-minus-edge-removal-critical graphs
- On independent domination critical graphs and \(k\)-factor critical.
- Independent domination in bipartite cubic graphs
- A characterization of \(3\)-\(i\)-critical graphs of connectivity two
This page was built for publication: Independent domination bicritical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622631)
