Triangulations and equality in the domination chain
From MaRDI portal
Publication:494427
DOI10.1016/j.dam.2015.05.025zbMath1319.05098OpenAlexW833184608MaRDI QIDQ494427
Stephen Finbow, Christopher M. van Bommel
Publication date: 1 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.025
Related Items
Reconfiguring dominating sets in some well-covered and other classes of graphs, Irredundance, Well-totally-dominated graphs, On well-dominated direct, Cartesian and strong product graphs
Cites Work
- On well-covered triangulations. II.
- On well-covered triangulations. III
- A characterization of well covered graphs of girth 5 or greater
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- On well-covered triangulations. I
- Well irredundant graphs
- Complexity results for well‐covered graphs
- WELL-COVERED GRAPHS: A SURVEY
- A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
- Some covering concepts in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item