Partitioning a graph into alliance free sets

DOI10.1016/J.DISC.2008.08.011zbMath1218.05148OpenAlexW2132985585MaRDI QIDQ1025928

Khurram Shafique, Ronald D. Dutton

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 partitionalliancedefensive alliancealliance cover setalliance-free set

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Alliance free sets in Cartesian product graphs ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications ⋮ Alliances and Related Domination Parameters

Cites Work

• 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
• On decomposition of triangle-free graphs under degree constraints
• Offensive alliances in graphs
• Decomposing graphs with girth at least five under degree constraints

This page was built for publication: Partitioning a graph into alliance free sets