Bounds for judicious balanced bipartitions of graphs
From MaRDI portal
Publication:1756085
DOI10.1007/s00373-018-1949-xzbMath1402.05111OpenAlexW2893098081WikidataQ129182292 ScholiaQ129182292MaRDI QIDQ1756085
Han Ren, Yujiao Luo, Fayun Cao
Publication date: 11 January 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-018-1949-x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On judicious bisections of graphs
- A note on balanced bipartitions
- On a bottleneck bipartition conjecture of Erdős
- Exact bounds for judicious partitions of graphs
- Judicious partitions of bounded‐degree graphs
- Problems and results on judicious partitions
- Balanced judicious bipartitions of graphs
- Better Bounds for k-Partitions of Graphs
This page was built for publication: Bounds for judicious balanced bipartitions of graphs