摘要
The cutwidth of a graph G is the minimum number of overlap edges when G is embedded into a path Pn.The cutwidth problem for a graph G is to determine the cutwidth of G.A graph G with cutwidth k is k-cutwidth critical if every proper subgraph of G has cutwidth less than k and G is homeomorphically minimal.In this paper,we completely investigated methods of forming a k-cutwidth(k>1)critical tree T.
作者
张振坤
叶稀琼
ZHANG Zhen-kun;YE Xi-qiong(School of Mathematics and Statistics,Huanghuai University,Zhumadian 463000,China;Zhengzhou Electronic Information Engineering College,Zhenzhou 450007,China)
基金
Supported by Soft Science Foundation of Henan Province(Grant No.192400410212)
the Science and Technology Key Project of Henan Province of China(Grant No.22210211008)。
