Strategic balance in graphs

DOI10.1016/j.disc.2016.02.004zbMath1334.05119OpenAlexW2300897768MaRDI QIDQ279193

Michał Małafiejski, Robert Lewoń, Anna Małafiejska

Publication date: 27 April 2016

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

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

zbMATH Keywords

alliance partitioning numberglobal alliancestrategic balance

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Global edge alliances in graphs

Uses Software

• nauty

Cites Work

• Global defensive alliances in graphs
• The Many Names of (7, 3, 1)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strategic balance in graphs