Partitioning a graph into offensive \(k\)-alliances

DOI10.1016/j.dam.2010.11.005zbMath1210.05114WikidataQ57974381 ScholiaQ57974381MaRDI QIDQ629362

Ismael González Yero, Sergio Bermudo, Juan Alberto Rodríguez-Velázquez, José María Sigarreta-Almira

Publication date: 9 March 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.11.005

zbMATH Keywords

chromatic number; domination number; dominating sets; offensive alliances

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)