Partitioning a graph into offensive \(k\)-alliances
type: Item
instance of: scholarly article
title: Partitioning a graph into offensive \(k\)-alliances
zbMATH Open document ID: 1210.05114
author: Sergio Bermudo
author: Jose M. Sigarreta
author: Ismael G. Yero
author: Juan A. Rodríguez-Velázquez
published in: Discrete Applied Mathematics
publication date: 2011-03-09T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5862858
zbMATH Keywords: offensive alliances
zbMATH Keywords: dominating sets
zbMATH Keywords: domination number
zbMATH Keywords: chromatic number
Wikidata QID: Q57974381
MaRDI profile type: Publication
full work available at URL: j.dam.2010.11.005
OpenAlex ID: W2743337920
cites work: On global offensive \(k\)-alliances in graphs
cites work: Q4677972
cites work: Global alliances and independence in trees
cites work: Q3620532
cites work: Q4897506
cites work: Offensive alliances in graphs
cites work: Offensive \(r\)-alliances in graphs
cites work: Global defensive alliances in graphs
cites work: The alliance partition number of grid graphs
cites work: Q4820818
cites work: Defensive \(k\)-alliances in graphs
cites work: Global defensive \(k\)-alliances in graphs
cites work: Q4472692
cites work: Q4405794
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.DAM.2010.11.005
description: scientific article; zbMATH DE number 5862858