Abstract
The problem studied in this paper is to determine E(p,C), the maximum size of a connected graph G with the given vertex number p and cutwidth C. This paper presents some results on this problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Lengauer, T.,Upper and lower bounds on the complexity of the min-cut linear arrangement problem on trees.SIAM J. Algebraic Discrete Methods,1982,3:99–113.
Chung, F. R. K.,Labelings of graphs,In:L. W. Beineke and R. J. Wilson,ed.,Selected Topics in Graph Theory (3),London:Academic Press Inc.,1988,151–168.
Garey, M. R., Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-completeness,San Francisco:W. H. Freeman and Sons,1979.
Bondy, J. A.,Murty, U. S. R.,Graph Theory with Applications,London:Macmillan Press Ltd,1976.
Liu Hongen,Yuan Jinjiang,Cutwidth problem on graphs,Appl. Math. J. Chinese Univ. Ser. A,1995,10:339–348.
Author information
Authors and Affiliations
Additional information
Supported by Natural Science Foundation of Zhejiang Province(102055).
Rights and permissions
About this article
Cite this article
Hao, J. Maximum cutwidth problem for graphs. Appl. Math. Chin. Univ. 18, 235–242 (2003). https://doi.org/10.1007/s11766-003-0030-5
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11766-003-0030-5