The cyclic cutwidth of trees (Q1270769): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The congestion of \(n\)-cube layout on a rectangular grid / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3803160 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Assignments of Numbers to Vertices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2103020672 / rank | |||
Normal rank |
Latest revision as of 10:21, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The cyclic cutwidth of trees |
scientific article |
Statements
The cyclic cutwidth of trees (English)
0 references
3 November 1998
0 references
For an embedding of a graph \(G\) in another graph \(H\), the cutwidth of the embedding is the maximum number of edges of \(G\) along an edge of the host graph. The (linear) cutwidth of a graph is the minimum cutwidth of an embedding in a path; the cyclic cutwidth of a graph is the minimum cutwidth of an embedding in a cycle. In this paper, it is shown that the cyclic cutwidth of a tree equals its linear cutwidth.
0 references
embedding
0 references
cyclic cutwidth
0 references
tree
0 references
linear cutwidth
0 references