Partitionable graphs arising from near-factorizations of finite groups

Arnaud PĂȘcher. Partitionable graphs arising from near-factorizations of finite groups. Discrete Mathematics, 269(1-3):191-218, 2003. [doi]

@article{Pecher03,
  title = {Partitionable graphs arising from near-factorizations of finite groups},
  author = {Arnaud PĂȘcher},
  year = {2003},
  doi = {10.1016/S0012-365X(02)00755-0},
  url = {http://dx.doi.org/10.1016/S0012-365X(02)00755-0},
  tags = {graph-rewriting, rewriting, partitioning},
  researchr = {https://researchr.org/publication/Pecher03},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {269},
  number = {1-3},
  pages = {191-218},
}