Defensive alliances in graphs

DOI10.1016/j.tcs.2022.06.021OpenAlexW3213844792MaRDI QIDQ2079875

Ajinkya Gaikwad, Soumen Maity

Publication date: 7 October 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.05545

zbMATH Keywords

feedback vertex setFPTparameterised complexitycircle graphdefensive allianceW[1-hard]ETHtreedepth

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Structural parameterization of alliance problems ⋮ Offensive alliances in graphs

Cites Work

• Unnamed Item
• 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
• On the global offensive alliance number of a graph
• Offensive \(r\)-alliances in graphs
• On the complement graph and defensive \(k\)-alliances
• The complexity of domination problems in circle graphs
• Treewidth. Computations and approximations
• Defensive alliances in graphs of bounded treewidth
• Alliances in graphs of bounded clique-width
• On structural parameterizations of the offensive alliance problem
• On defensive alliances and line graphs
• Global offensive alliances in graphs
• Kernelization
• Global alliances and independence in trees
• Parameterized Algorithms
• Problems hard for treewidth but easy for stable gonality

This page was built for publication: Defensive alliances in graphs