scientific article; zbMATH DE number 2077650
From MaRDI portal
Publication:4472692
zbMath1046.05060MaRDI QIDQ4472692
Khurram Shafique, Ronald D. Dutton
Publication date: 1 July 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (24)
Security in graphs ⋮ Global strong defensive alliances of Sierpiński-like graphs ⋮ On global offensive \(k\)-alliances in graphs ⋮ Partitioning a graph into global powerful \(k\)-alliances ⋮ Global defensive alliances in the lexicographic product of paths and cycles ⋮ Structural parameterization of alliance problems ⋮ Partitioning a graph into offensive \(k\)-alliances ⋮ Alliance free and alliance cover sets ⋮ Alliances in graphs: parameters, properties and applications -- a survey ⋮ Client-server and cost effective sets in graphs ⋮ Alliance free sets in Cartesian product graphs ⋮ Global offensive alliances in graphs and random graphs ⋮ Bounds on a graph's security number ⋮ Partitioning a graph into defensive \(k\)-alliances ⋮ Boundary defensive \(k\)-alliances in graphs ⋮ Alliances in graphs of bounded clique-width ⋮ Global defensive \(k\)-alliances in graphs ⋮ Offensive \(r\)-alliances in graphs ⋮ Alliances and Related Domination Parameters ⋮ Partitioning a graph into alliance free sets ⋮ Defensive \(k\)-alliances in graphs ⋮ On a graph's security number ⋮ Unnamed Item ⋮ Saturated boundary \(k\)-alliances in graphs
This page was built for publication:
