Partitioning to three matchings of given size is NP-complete for bipartite graphs
References
- [1] P. Berman, M. Karpinski, ICALP, LNCS 1644 (1999) 200-209. ⇒208, 209
- [2] J. H. Folkman, D. R. Fulkerson, Edge colorings in bipartite graphs. RAND Memorandum RM-5061-PR, RAND Corporation, 1966. ⇒206
- [3] M. R. Garey, D. S. Johnson, L. J. Stockmeyer, Some simplified NP-complete graph problems, Theor. Comput. Sci. 1, 3 (1976) 237-267. ⇒207
DOI: https://doi.org/10.1515/ausi-2015-0004 | Journal eISSN: 2066-7760
Language: English
Page range: 206 - 209
Submitted on: Jul 11, 2014
Published on: Jan 27, 2015
Published by: Sapientia Hungarian University of Transylvania
In partnership with: Paradigm Publishing Services
Publication frequency: 2 times per year
Related subjects:
© 2015 Dömötör Pálvölgyi, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.