BibTeX record journals/arscom/Byer01

download as .bib file

@article{DBLP:journals/arscom/Byer01,
  author       = {Owen D. Byer},
  title        = {Maximum number of 3-paths in a graph},
  journal      = {Ars Comb.},
  volume       = {61},
  year         = {2001},
  timestamp    = {Fri, 12 Dec 2003 15:06:12 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/Byer01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics