Partitioning a graph into alliance free sets
type: Item
instance of: scholarly article
title: Partitioning a graph into alliance free sets
zbMATH Open document ID: 1218.05148
author: Khurram Shafique
author: Ronald D. Dutton
published in: Discrete Mathematics
publication date: 2009-06-23T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5569055
zbMATH Keywords: alliance
zbMATH Keywords: defensive alliance
zbMATH Keywords: alliance-free set
zbMATH Keywords: alliance cover set
zbMATH Keywords: vertex partition
MaRDI profile type: Publication
full work available at URL: j.disc.2008.08.011
OpenAlex ID: W2132985585
cites work: Unfriendly partitions of a graph
cites work: The satisfactory partition problem
cites work: On a theorem about vertex colorings of graphs
cites work: On an upper bound of the graph's chromatic number, depending on the graph's degree and density
cites work: Powerful alliances in graphs
cites work: Decomposing graphs with girth at least five under degree constraints
cites work: Offensive alliances in graphs
cites work: Partition of graphs with condition on the connectivity and minimum degree
cites work: Global defensive alliances in graphs
cites work: Q4820818
cites work: On decomposition of triangle-free graphs under degree constraints
cites work: Q4405794
cites work: Q5488895
cites work: Q4472692
cites work: Q3211331
cites work: Q4715286
cites work: Graph decomposition with constraints on the connectivity and minimum degree
DOI: 10.1016/J.DISC.2008.08.011
description: scientific article; zbMATH DE number 5569055