Partitioning a graph into alliance free sets

DOI10.1016/j.disc.2008.08.011zbMath1218.05148MaRDI QIDQ1025928

Ronald D. Dutton, Khurram Shafique

Publication date: 23 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.08.011

zbMATH Keywords

vertex partition; alliance; defensive alliance; alliance cover set; alliance-free set

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.)

Related Items

Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications, Alliance free sets in Cartesian product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a theorem about vertex colorings of graphs
• Unfriendly partitions of a graph
• Partition of graphs with condition on the connectivity and minimum degree
• Powerful alliances in graphs
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• Global defensive alliances in graphs
• The satisfactory partition problem
• Graph decomposition with constraints on the connectivity and minimum degree
• Offensive alliances in graphs