Reconfiguring dominating sets in some well-covered and other classes of graphs
From MaRDI portal
Publication:2397524
DOI10.1016/J.DISC.2017.03.007zbMATH Open1362.05097OpenAlexW2605510696MaRDI QIDQ2397524FDOQ2397524
Authors: Ruth Haas, K. Seyffarth 
Publication date: 22 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.03.007
Recommendations
- Reconfiguration graphs for dominating sets
- Reconfiguring dominating sets in minor-closed graph classes
- Reconfiguration of dominating sets
- Reconfiguration of dominating sets
- scientific article; zbMATH DE number 7272506
- scientific article; zbMATH DE number 4103125
- On the parameterized complexity of reconfiguration of connected dominating sets
- scientific article; zbMATH DE number 7764115
- The complexity of dominating set reconfiguration
- The complexity of dominating set reconfiguration
Cites Work
- Graph theory
- Title not available (Why is that?)
- A characterization of well covered graphs of girth 5 or greater
- Some covering concepts in graphs
- The \(k\)-dominating graph
- Connectedness of the graph of vertex-colourings
- Gray code numbers for graphs
- Reconfiguration of dominating sets
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- On the complexity of reconfiguration problems
- A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
- Title not available (Why is that?)
- Reconfiguration of list edge-colorings in a graph
- A note on graphs which have upper irredundance equal to independence
- Triangulations and equality in the domination chain
- Title not available (Why is that?)
- Reconfiguring \(k\)-colourings of complete bipartite graphs
Cited In (12)
- Irredundance trees of diameter 3
- Reconfiguring vertex colourings of 2-trees
- Connected \(k\)-dominating graphs
- Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters
- Irredundance graphs
- Introduction to reconfiguration
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets
- On k-Total Dominating Graphs
- Reconfiguring shortest paths in graphs
- Reconfiguring minimum dominating sets in trees
- Linear transformations between dominating sets in the TAR-model
- Reconfiguration graphs for dominating sets
This page was built for publication: Reconfiguring dominating sets in some well-covered and other classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397524)
