典型文献
Forming a Critical Tree with Cutwidth k
文献摘要：
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
文献出处：
引用格式：
[1]ZHANG Zhen-kun;YE Xi-qiong-.Forming a Critical Tree with Cutwidth k)[J].数学季刊（英文版）,2022(04):366-379
A类：
Cutwidth,cutwidth,homeomorphically
B类：
Forming,Critical,Tree,minimum,number,overlap,edges,when,embedded,into,path,Pn,problem,determine,critical,if,every,proper,subgraph,has,less,than,minimal,In,this,paper,we,completely,investigated,methods,forming,tree
AB值：
0.486649
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
