Unfriendly partitions of a graph

DOI10.1016/0095-8956(90)90092-EzbMath0717.05065OpenAlexW2057094213MaRDI QIDQ753841

Ron Aharoni, Eric C. Milner, Karel Prikry

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90092-e

zbMATH Keywords

infinite graphvertex partitionunfriendly partition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (25)

Problems and results on judicious partitions ⋮ Structural and algorithmic properties of 2-community structures ⋮ Security in graphs ⋮ Very cost effective bipartitions in graphs ⋮ Majority choosability of digraphs ⋮ Friendly bisections of random graphs ⋮ Majority choosability of countable graphs ⋮ A note on median eigenvalues of subcubic graphs ⋮ Majority edge-colorings of graphs ⋮ Unfriendly partitions for graphs not containing a subdivison of an infinite cycle ⋮ Every rayless graph has an unfriendly partition ⋮ Every rayless graph has an unfriendly partition ⋮ SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS ⋮ Bounds on a graph's security number ⋮ Satisfactory graph partition, variants, and generalizations ⋮ Generalized graph \(k\)-coloring games ⋮ 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 ⋮ Judicious partitions of graphs ⋮ Game $k$-Domination Number of Graphs

Cites Work

• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• Axiomatic Treatment of Rank in Infinite Sets

This page was built for publication: Unfriendly partitions of a graph