scientific article; zbMATH DE number 1933255

zbMath1022.05068MaRDI QIDQ4405794

Khurram Shafique, Ronald D. Dutton

Publication date: 30 October 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items

Security in graphs ⋮ Very cost effective bipartitions in graphs ⋮ Bounds for metric dimension and defensive $k$-alliance of graphs under deleted lexicographic product ⋮ On some open problems concerning quorum colorings of graphs ⋮ Partitioning a graph into global powerful \(k\)-alliances ⋮ Friendly bisections of random graphs ⋮ Weak internal partition of regular graphs ⋮ Global defensive alliances in the lexicographic product of paths and cycles ⋮ On global defensive k-alliances in zero-divisor graphs of finite commutative rings ⋮ Global defensive alliances of trees and Cartesian product of paths and cycles ⋮ A note on internal partitions: the 5-regular case and beyond ⋮ Min-max communities in graphs: complexity and computational properties ⋮ Partitioning a graph into offensive \(k\)-alliances ⋮ Graph partitions under average degree constraint ⋮ Alliances in graphs: parameters, properties and applications -- a survey ⋮ Alliance free sets in Cartesian product graphs ⋮ Bounds on a graph's security number ⋮ Distribution of global defensive \(k\)-alliances over some graph products ⋮ Partitioning a graph into defensive \(k\)-alliances ⋮ Satisfactory graph partition, variants, and generalizations ⋮ The satisfactory partition problem ⋮ Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization ⋮ Global defensive \(k\)-alliances in graphs ⋮ Alliances and Related Domination Parameters ⋮ Asymptotically almost every \(2r\)-regular graph has an internal partition ⋮ Internal Partitions of Regular Graphs ⋮ Powerful alliances in graphs ⋮ Stabilization Time in Weighted Minority Processes ⋮ Partitioning a graph into alliance free sets ⋮ On the complement graph and defensive \(k\)-alliances ⋮ Defensive \(k\)-alliances in graphs ⋮ Bounds on cost effective domination numbers ⋮ On a graph's security number ⋮ A note on the satisfactory partition problem: constant size requirement ⋮ Saturated boundary \(k\)-alliances in graphs ⋮ (Dis)assortative partitions on random regular graphs