scientific article
From MaRDI portal
Publication:3211331
zbMath0723.05058MaRDI QIDQ3211331
Saharon Shelah, Eric C. Milner
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
Security in graphs ⋮ Very cost effective bipartitions in graphs ⋮ Majority choosability of digraphs ⋮ Friendly bisections of random graphs ⋮ Majority choosability of countable graphs ⋮ Every rayless graph has an unfriendly partition ⋮ Bounds on a graph's security number ⋮ Satisfactory graph partition, variants, and generalizations ⋮ Alliances and Related Domination Parameters ⋮ Self-Stabilizing Domination Algorithms ⋮ Stabilization Time in Weighted Minority Processes ⋮ Partitioning a graph into alliance free sets ⋮ Bounds on cost effective domination numbers ⋮ On a graph's security number ⋮ Linear time algorithms for weighted offensive and powerful alliances in trees
This page was built for publication:
