The cyclic cutwidth of trees (Q1270769): Difference between revisions

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.