BibTeX record journals/gc/Yeo99

download as .bib file

@article{DBLP:journals/gc/Yeo99,
  author       = {Anders Yeo},
  title        = {How Close to Regular Must a Semicomplete Multipartite Digraph Be to
                  Secure Hamiltonicity?},
  journal      = {Graphs Comb.},
  volume       = {15},
  number       = {4},
  pages        = {481--493},
  year         = {1999},
  url          = {https://doi.org/10.1007/s003730050080},
  doi          = {10.1007/S003730050080},
  timestamp    = {Thu, 04 Jun 2020 19:40:08 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/Yeo99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.