Characterizations of k-cutwidth critical trees

Zhen-Kun Zhang () and Hong-Jian Lai ()
Additional contact information
Zhen-Kun Zhang: Huanghuai University
Hong-Jian Lai: West Virginia University

Journal of Combinatorial Optimization, 2017, vol. 34, issue 1, No 16, 233-244

Abstract: Abstract The cutwidth problem for a graph G is to embed G into a path such that the maximum number of overlap edges (i.e., the congestion) is minimized. The investigations of critical graphs and their structures are meaningful in the study of a graph-theoretic parameters. We study the structures of k-cutwidth $$(k>1)$$ ( k > 1 ) critical trees, and use them to characterize the set of all 4-cutwidth critical trees.

Keywords: Graph labeling; Cutwidth; Critical tree (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0061-5 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:34:y:2017:i:1:d:10.1007_s10878-016-0061-5

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

DOI: 10.1007/s10878-016-0061-5

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 ().