scientific article; zbMATH DE number 4191687
From MaRDI portal
Publication:3211331
zbMATH Open0723.05058MaRDI QIDQ3211331FDOQ3211331
Publication date: 1990
Title of this publication is not available (Why is that?)
Cited In (19)
- Stabilization Time in Weighted Minority Processes
- Security in graphs
- Unmixed r-partite graphs
- Bounds on a graph's security number
- Friendly bisections of random graphs
- Linear time algorithms for weighted offensive and powerful alliances in trees
- Majority choosability of countable graphs
- Very cost effective bipartitions in graphs
- Majority coloring of infinite digraphs
- Every rayless graph has an unfriendly partition
- Partitioning a graph into alliance free sets
- Satisfactory graph partition, variants, and generalizations
- Graphs without a partition into two proportionally dense subgraphs
- Bounds on cost effective domination numbers
- Partitioning problems via random processes
- On a graph's security number
- Alliances and Related Domination Parameters
- Majority choosability of digraphs
- Self-Stabilizing Domination Algorithms
Recommendations
- Unfriendly partitions of a graph 👍 👎
- Every rayless graph has an unfriendly partition 👍 👎
- Unfriendly partitions for graphs not containing a subdivison of an infinite cycle 👍 👎
- SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS 👍 👎
- Measure-theoretic unfriendly colorings 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3211331)
