Decomposing complete tripartite graphs into cycles of lengths 3 and 4

Elizabeth J. Billington. Decomposing complete tripartite graphs into cycles of lengths 3 and 4. Discrete Mathematics, 197-198:123-135, 1999. [doi]

@article{Billington99:0,
  title = {Decomposing complete tripartite graphs into cycles of lengths 3 and 4},
  author = {Elizabeth J. Billington},
  year = {1999},
  doi = {10.1016/S0012-365X(99)90049-3},
  url = {http://dx.doi.org/10.1016/S0012-365X(99)90049-3},
  tags = {completeness, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Billington99%3A0},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {197-198},
  pages = {123-135},
}