Decomposability of a class of k-cutwidth critical graphs

Zhen-Kun Zhang (), Zhong Zhao () and Liu-Yong Pang ()
Additional contact information
Zhen-Kun Zhang: Huanghuai University
Zhong Zhao: Huanghuai University
Liu-Yong Pang: Huanghuai University

Journal of Combinatorial Optimization, 2022, vol. 43, issue 2, No 5, 384-401

Abstract: Abstract The cutwidth minimization problem consists of finding an arrangement of the vertices of a graph G on a line $$P_n$$ P n with $$n=|V(G)|$$ 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$$ k ≥ 2 , which can be decomposed into three $$(k-1)$$ ( k - 1 ) -cutwidth critical subgraphs.

Keywords: Graph labeling; Cutwidth; Critical graph; Decomposability; 05C75; 05C78; 90C27 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00782-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:43:y:2022:i:2:d:10.1007_s10878-021-00782-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00782-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().