摘要: The problem studied in this paper is to determine e(p, C), the minimum size of a connected graph G with given vertex number p and cut-width C.
中图分类号:
郝建修, 杨爱峰. 图的割宽极值问题[J]. 数学季刊, 2006, 21(1): 38-43.
HAO Jian-xiu, YANG Ai-feng. Extremal Cut-width Problem for Graphs[J]. Chinese Quarterly Journal of Mathematics, 2006, 21(1): 38-43.