Defensive alliances in graphs
type: Item
instance of: scholarly article
title: Defensive alliances in graphs
author: Ajinkya Gaikwad
author: Soumen Maity
published in: Theoretical Computer Science
publication date: 2022-10-07T00:00:00Z
full work available at URL: https://arxiv.org/abs/2111.05545
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7597582
zbMATH Keywords: defensive alliance
zbMATH Keywords: parameterised complexity
zbMATH Keywords: FPT
zbMATH Keywords: W[1]-hard
zbMATH Keywords: treedepth
zbMATH Keywords: feedback vertex set
zbMATH Keywords: ETH
zbMATH Keywords: circle graph
MaRDI profile type: Publication
OpenAlex ID: W3213844792
cites work: Defensive alliances in graphs of bounded treewidth
cites work: Problems hard for treewidth but easy for stable gonality
cites work: Global defensive alliances of trees and Cartesian product of paths and cycles
cites work: Global alliances and independence in trees
cites work: Parameterized Algorithms
cites work: Q4393480
cites work: Offensive \(r\)-alliances in graphs
cites work: Kernelization
cites work: Q4470237
cites work: On structural parameterizations of the offensive alliance problem
cites work: Q3635568
cites work: Q4252414
cites work: The complexity of domination problems in circle graphs
cites work: Alliances in graphs of bounded clique-width
cites work: Treewidth. Computations and approximations
cites work: Q4820818
cites work: Q4904144
cites work: Graph minors. III. Planar tree-width
cites work: Global offensive alliances in graphs
cites work: On the complement graph and defensive \(k\)-alliances
cites work: On defensive alliances and line graphs
cites work: On the global offensive alliance number of a graph
DOI: 10.1016/J.TCS.2022.06.021
description: scientific article; zbMATH DE number 7597582