The number of triangles in a K::4::-free graph

David C. Fisher. The number of triangles in a K::4::-free graph. Discrete Mathematics, 69(2):203-205, 1988. [doi]

@article{Fisher88-0,
  title = {The number of triangles in a K::4::-free graph},
  author = {David C. Fisher},
  year = {1988},
  doi = {10.1016/0012-365X(88)90021-0},
  url = {http://dx.doi.org/10.1016/0012-365X(88)90021-0},
  tags = {graph-rewriting, C++, rewriting},
  researchr = {https://researchr.org/publication/Fisher88-0},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {69},
  number = {2},
  pages = {203-205},
}