Judicious partitions of graphs
From MaRDI portal
Publication:1314903
DOI10.1007/BF01876314zbMath0796.05056MaRDI QIDQ1314903
Béla Bollobás, Alexander D. Scott
Publication date: 5 September 1994
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Related Items
Cites Work
- On a theorem about vertex colorings of graphs
- Unfriendly partitions of a graph
- How to make a graph bipartite
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Weighted sums of certain dependent random variables
- A note on bipartite subgraphs of triangle‐free graphs
- Probability Inequalities for Sums of Bounded Random Variables
- Some Extremal Properties of Bipartite Subgraphs