The alliance partition number of grid graphs

zbMath1138.05057MaRDI QIDQ2469300

Jason A. Lachniet, Teresa W. Haynes

Publication date: 5 February 2008

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

grid graphdefensive alliancealliance partitionalliance partition number

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 (9)

New sharp lower bound for the quorum coloring number of trees ⋮ On some open problems concerning quorum colorings of graphs ⋮ Partitioning a graph into global powerful \(k\)-alliances ⋮ Partitioning a graph into offensive \(k\)-alliances ⋮ Alliances in graphs: parameters, properties and applications -- a survey ⋮ Alliance free sets in Cartesian product graphs ⋮ Partitioning a graph into defensive \(k\)-alliances ⋮ Alliances and Related Domination Parameters ⋮ On the complexity of some quorum colorings problems of graphs

This page was built for publication: The alliance partition number of grid graphs