scientific article; zbMATH DE number 4191687
From MaRDI portal
Publication:3211331
Recommendations
Cited in
(35)- Partitioning a graph into alliance free sets
- On a graph's security number
- Unfriendly partitions for graphs not containing a subdivison of an infinite cycle
- Graphs without a partition into two proportionally dense subgraphs
- Linear time algorithms for weighted offensive and powerful alliances in trees
- Security in graphs
- Majority choosability of digraphs
- Bounds on a graph's security number
- Very cost effective bipartitions in graphs
- Alliances and Related Domination Parameters
- Self-Stabilizing Domination Algorithms
- Unmixed r-partite graphs
- Unfriendly colorings of graphs with finite average degree
- Stabilization Time in Weighted Minority Processes
- Measure-theoretic unfriendly colorings
- Bounds on cost effective domination numbers
- Self-stabilizing algorithms for unfriendly partitions into two disjoint dominating sets
- Every rayless graph has an unfriendly partition
- Every rayless graph has an unfriendly partition
- Friendly bisections of random graphs
- Majority choosability of countable graphs
- Majority coloring of infinite digraphs
- Partitioning problems via random processes
- A general stabilization bound for influence propagation in graphs
- On list extensions of the majority edge colourings
- Unfriendly partitions when avoiding vertices of finite degree
- Minority sets in graphs
- Majority dominator colorings of graphs
- Mrs. Correct and majority colorings
- Countable graphs are majority 3-choosable
- Unfriendly partition conjecture holds for line graphs
- All graphs are majority 3-choosable
- Majority sets in graphs
- Unfriendly partitions of a graph
- Satisfactory graph partition, variants, and generalizations
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)
