当前位置: X-MOL 学术J. Comb. Optim. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Decomposability of a class of k-cutwidth critical graphs
Journal of Combinatorial Optimization ( IF 1 ) Pub Date : 2021-07-24 , DOI: 10.1007/s10878-021-00782-6
Zhen-Kun Zhang 1 , Zhong Zhao 1 , Liu-Yong Pang 1
Affiliation  

The cutwidth minimization problem consists of finding an arrangement of the vertices of a graph G on a line \(P_n\) with \(n=|V(G)|\) vertices, in such a way that the maximum number of overlapping edges (i.e., the congestion) is minimized. 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 mainly investigated a class of decomposable k-cutwidth critical graphs for \(k\ge 2\), which can be decomposed into three \((k-1)\)-cutwidth critical subgraphs.



中文翻译:

一类k-cutwidth临界图的可分解性

cutwidth 最小化问题包括在具有\(n=|V(G)|\)顶点的直线\(P_n\)上找到图G的顶点的排列,这样可以使重叠边的最大数量(即拥塞)被最小化。一个图ģ与cutwidth ķ就是ķ -cutwidth至关重要的,如果每一个适当子图ģ具有比cutwidth更少ķģ是homeomorphically最小的。在本文中,我们主要研究了\(k\ge 2\) 的一类可分解k -cutwidth 临界图,可以将其分解为三个\((k-1)\)-cutwidth 关键子图。

更新日期:2021-07-24
down
wechat
bug