Every Cycle-Connected Multipartite Tournament with δ ≥ 2 Contains At Least Two Universal Arcs

Qingsong Zou, Guojun Li, Yunshu Gao. Every Cycle-Connected Multipartite Tournament with δ ≥ 2 Contains At Least Two Universal Arcs. Graphs and Combinatorics, 29(4):1141-1149, 2013. [doi]

@article{ZouLG13,
  title = {Every Cycle-Connected Multipartite Tournament with δ ≥ 2 Contains At Least Two Universal Arcs},
  author = {Qingsong Zou and Guojun Li and Yunshu Gao},
  year = {2013},
  doi = {10.1007/s00373-012-1170-2},
  url = {http://dx.doi.org/10.1007/s00373-012-1170-2},
  researchr = {https://researchr.org/publication/ZouLG13},
  cites = {0},
  citedby = {0},
  journal = {Graphs and Combinatorics},
  volume = {29},
  number = {4},
  pages = {1141-1149},
}