Forming a Critical Tree with Cutwidth k  

k割宽临界树的构造

作　　者：ZHANG Zhen-kun YE Xi-qiong 张振坤;叶稀琼(School of Mathematics and Statistics,Huanghuai University,Zhumadian 463000,China;Zhengzhou Electronic Information Engineering College,Zhenzhou 450007,China)

机构地区：[1]School of Mathematics and Statistics,Huanghuai University,Zhumadian 463000,China [2]Zhengzhou Electronic Information Engineering College,Zhenzhou 450007,China

出　　处：《Chinese Quarterly Journal of Mathematics》2022年第4期366-379,共14页数学季刊（英文版）

基　　金：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)。

摘　　要：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.

关 键 词：COMBINATORICS Graph labeling Cutwidth Critical tree 

分 类 号：O157.6[理学—数学] O221[理学—基础数学]