Reconfiguring minimum independent dominating sets in graphs
From MaRDI portal
Cites work
- -graphs of graphs
- A note on -graphs
- A note on some variations of the -graph
- Gamma graphs of some special classes of trees
- scientific article; zbMATH DE number 6506585 (Why is no real title available?)
- scientific article; zbMATH DE number 5717232 (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 7272506 (Why is no real title available?)
- scientific article; zbMATH DE number 3390777 (Why is no real title available?)
- Induced subgraphs of gamma graphs
- Introduction to reconfiguration
- On the complexity of reconfiguration problems
- On the structure of dominating graphs
- Reconfiguration graphs for dominating sets
- Reconfiguration of dominating sets
- Reconfiguring dominating sets in some well-covered and other classes of graphs
- The \(k\)-dominating graph
- The complexity of dominating set reconfiguration
- The gamma graph of a graph
Cited in
(1)
This page was built for publication: Reconfiguring minimum independent dominating sets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7017515)