Globally minimal defensive alliances

DOI10.1016/j.ipl.2022.106253OpenAlexW4210554953MaRDI QIDQ2671799

Ajinkya Gaikwad, Soumen Maity

Publication date: 3 June 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106253

zbMATH Keywords

algorithmstreewidthFPTW[1-hard]

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global defensive alliances of trees and Cartesian product of paths and cycles
• Graph minors. III. Planar tree-width
• Parameterized complexity of locally minimal defensive alliances
• On the global offensive alliance number of a graph
• Offensive \(r\)-alliances in graphs
• On the complement graph and defensive \(k\)-alliances
• Defensive alliances in graphs of bounded treewidth
• Aspects of upper defensive alliances
• On defensive alliances and line graphs
• Global offensive alliances in graphs
• Small Alliances in Graphs
• A survey on alliances and related parameters in graphs
• Parameterized Algorithms