Unfriendly partitions of a graph

DOI10.1016/0095-8956(90)90092-EMaRDI QIDQ753841zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4191687
• Unfriendly partitions for graphs not containing a subdivison of an infinite cycle
• Every rayless graph has an unfriendly partition
• Note on vertex-partitions of infinite graphs
• Measure-theoretic unfriendly colorings

Cites work

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

Cited in

(30)

• Self-Stabilizing Domination Algorithms
• Stabilization Time in Weighted Minority Processes
• Security in graphs
• Problems and results on judicious partitions
• Bounds on a graph's security number
• Generalized graph \(k\)-coloring games
• Friendly bisections of random graphs
• Linear time algorithms for weighted offensive and powerful alliances in trees
• Majority edge-colorings of graphs
• Structural and algorithmic properties of 2-community structures
• Game $k$-Domination Number of Graphs
• Majority choosability of countable graphs
• A note on median eigenvalues of subcubic graphs
• scientific article; zbMATH DE number 4191687 (Why is no real title available?)
• Very cost effective bipartitions in graphs
• Judicious partitions of 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
• Bounds on cost effective domination numbers
• Every rayless graph has an unfriendly partition
• On a graph's security number
• Partitioning problems via random processes
• Measure-theoretic unfriendly colorings
• Alliances and Related Domination Parameters
• Note on vertex-partitions of infinite graphs
• Majority choosability of digraphs
• Unfriendly partitions for graphs not containing a subdivison of an infinite cycle
• Self-stabilizing algorithms for unfriendly partitions into two disjoint dominating sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753841)