Open Access

Partitioning to three matchings of given size is NP-complete for bipartite graphs


Cite

[1] P. Berman, M. Karpinski, ICALP, LNCS 1644 (1999) 200-209. ⇒208, 20910.1007/3-540-48523-6_17Search in Google Scholar

[2] J. H. Folkman, D. R. Fulkerson, Edge colorings in bipartite graphs. RAND Memorandum RM-5061-PR, RAND Corporation, 1966. ⇒206Search in Google Scholar

[3] M. R. Garey, D. S. Johnson, L. J. Stockmeyer, Some simplified NP-complete graph problems, Theor. Comput. Sci. 1, 3 (1976) 237-267. ⇒20710.1016/0304-3975(76)90059-1Search in Google Scholar

eISSN:
2066-7760
Language:
English
Publication timeframe:
2 times per year
Journal Subjects:
Computer Sciences, other