BibTeX records: P. B. Konstadinidis

download as .bib file

@article{DBLP:journals/jgt/KohayakawaKM18,
  author       = {Yoshiharu Kohayakawa and
                  P. B. Konstadinidis and
                  Guilherme Oliveira Mota},
  title        = {On an anti-Ramsey threshold for sparse graphs with one triangle},
  journal      = {J. Graph Theory},
  volume       = {87},
  number       = {2},
  pages        = {176--187},
  year         = {2018},
  url          = {https://doi.org/10.1002/jgt.22150},
  doi          = {10.1002/JGT.22150},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KohayakawaKM18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KohayakawaKM14,
  author       = {Yoshiharu Kohayakawa and
                  P. B. Konstadinidis and
                  Guilherme Oliveira Mota},
  title        = {On an anti-Ramsey threshold for random graphs},
  journal      = {Eur. J. Comb.},
  volume       = {40},
  pages        = {26--41},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.ejc.2014.02.004},
  doi          = {10.1016/J.EJC.2014.02.004},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejc/KohayakawaKM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KohayakawaKM11,
  author       = {Yoshiharu Kohayakawa and
                  P. B. Konstadinidis and
                  Guilherme Oliveira Mota},
  title        = {On an anti-Ramsey property of random graphs},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {37},
  pages        = {237--242},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.endm.2011.05.041},
  doi          = {10.1016/J.ENDM.2011.05.041},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/endm/KohayakawaKM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics