The cyclic cutwidth of trees (Q1270769): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q242851 |
||
Property / reviewed by | |||
Property / reviewed by: Hans L. Bodlaender / rank | |||
Revision as of 18:29, 11 February 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