Reconfiguring dominating sets in some well-covered and other classes of graphs

DOI10.1016/J.DISC.2017.03.007MaRDI QIDQ2397524zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graph dominationindependent setsreconfiguration problems

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Reconfiguration graphs for dominating sets
• Reconfiguring dominating sets in minor-closed graph classes
• 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

• scientific article; zbMATH DE number 4063149 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 786177 (Why is no real title available?)
• A characterization of well covered graphs of girth 5 or greater
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• A note on graphs which have upper irredundance equal to independence
• Connectedness of the graph of vertex-colourings
• Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
• Graph theory
• Gray code numbers for graphs
• On the complexity of reconfiguration problems
• Reconfiguration of list edge-colorings in a graph
• Reconfiguring \(k\)-colourings of complete bipartite graphs
• Some covering concepts in graphs
• The \(k\)-dominating graph
• Triangulations and equality in the domination chain

Cited in

(12)

• Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters
• Reconfiguring shortest paths in graphs
• Irredundance trees of diameter 3
• On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets
• Reconfiguring vertex colourings of 2-trees
• Reconfiguring minimum dominating sets in trees
• Connected \(k\)-dominating graphs
• Reconfiguration graphs for dominating sets
• Introduction to reconfiguration
• Linear transformations between dominating sets in the TAR-model
• On k-Total Dominating Graphs
• Irredundance graphs

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)