基金Supported by the Zhejiang Provincial Natural Science Foundation of China(102055)Supported by the NSF of China(10471131)Supported by the Foundation of Zhejiang Universities' Youth Teachers
文摘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.