Matching preclusion for the (::::n, k::::)-bubble-sort graphs

Eddie Cheng, László Lipták, David Sherman. Matching preclusion for the (::::n, k::::)-bubble-sort graphs. Int. J. Comput. Math., 87(11):2408-2418, 2010. [doi]

@article{ChengLS10-0,
  title = {Matching preclusion for the (::::n, k::::)-bubble-sort graphs},
  author = {Eddie Cheng and László Lipták and David Sherman},
  year = {2010},
  doi = {10.1080/00207160902883514},
  url = {http://dx.doi.org/10.1080/00207160902883514},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ChengLS10-0},
  cites = {0},
  citedby = {0},
  journal = {Int. J. Comput. Math.},
  volume = {87},
  number = {11},
  pages = {2408-2418},
}