On 3-cutwidth critical graphs

  title={On 3-cutwidth critical graphs},
  author={Yixun Lin and Aifeng Yang},
  journal={Discrete Mathematics},
The cutwidth of a graph G is the minimum congestion (the number of overlap edges) when G is embedded into a path. The cutwidth problem has been motivated from both applied and theoretical points of view. The characterization of forbidden subgraphs or critical graphs is always interesting in the study of a graph-theoretic parameter. In this paper we characterize the set of 3-cutwidth critical graphs by 5ve speci5ed elements. c © 2003 Elsevier B.V. All rights reserved. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications citing this paper.
Showing 1-3 of 3 extracted citations


Publications referenced by this paper.
Showing 1-10 of 14 references

The cutwidth of trees with diameter at most 4

Y. Lin
Appl. Math. J. Chinese Univ. Ser. B 18 • 2003
View 1 Excerpt

A degree sequence method for the cutwidth problem of graphs

Y. Lin, X. Li, A. Yang
Appl. Math. J. Chinese Univ. Ser. B 17 (2) • 2002
View 1 Excerpt

Cutwidth problem on graphs

H. Liu, J. Yuan
Appl. Math. J. Chinese Univ. Ser. A 10 (3) • 1995

Optimal Cutwidth of Meshes

J. Rolin, O. Sykora, I. Vrto
Lecture Notes in Computer Science, Vol. 1017, Springer, Berlin • 1995

The arrangement and 5ll-in of graphs

J. Yuan
Ph.D. Thesis, Sichuan University, China • 1995
View 1 Excerpt

Tree - width , pathwidth and cutwidth

N. Solel Korach
Discrete Appl . Math . • 1993


E. Korach, N. Solel
path-width and cutwidth, Discrete Appl. Math. 43 • 1993
View 2 Excerpts