Better Bounds for k-Partitions of Graphs

Abstract

Combinatorics, Probability and Computing / Volume 20 / Issue 04 / July 2011, pp 631 640 DOI: 10.1017/S0963548311000204, Published online: 31 May 2011 Link to this article: http://journals.cambridge.org/abstract_S0963548311000204 How to cite this article: BAOGANG XU and XINGXING YU (2011). Better Bounds for k-Partitions of Graphs. Combinatorics, Probability… (More)
DOI: 10.1017/S0963548311000204

Topics

  • Presentations referencing similar topics