Author:
Zhang Cui,Zhao Li-Qing,Wang Rong-Long
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problem. Theor. Comput. Sci., 237–267 (1976)
2. Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–104. Plenum, New York (1972)
3. Even, S., Shiloach, Y.: NP-completeness of several arrangement problems. Technical Report 43, Department of computer Science, Technion, Haifa Israel (1975)
4. Bondy, J.A., Locke, S.C.: Largest bipartite subgraph in triangle-free graphs with maximum degree three. J. Graph Theory, 477–504 (1986)
5. Grotscheland, M., Pulleyblank, W.R.: Weakly bipartite graphs and the max-cut problem. Oper. Res. Lett., 23–27 (1981)