Complexity of a disjoint matching problem on bipartite graphs

Gregory J. Puleo. Complexity of a disjoint matching problem on bipartite graphs. Inf. Process. Lett., 116(10):649-652, 2016. [doi]

@article{Puleo16,
  title = {Complexity of a disjoint matching problem on bipartite graphs},
  author = {Gregory J. Puleo},
  year = {2016},
  doi = {10.1016/j.ipl.2016.05.005},
  url = {http://dx.doi.org/10.1016/j.ipl.2016.05.005},
  researchr = {https://researchr.org/publication/Puleo16},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {116},
  number = {10},
  pages = {649-652},
}