Content deleted Content added
No edit summary |
m Open access bot: arxiv updated in citation with #oabot. |
||
Line 82:
* {{cite journal |last1=Goddyn |first1=L. |last2=Wong |first2=Erick B. |title=Tight instances of the lonely runner |url=http://people.math.sfu.ca/~goddyn/Papers/063tight_lonely_runner.pdf |access-date=1 May 2022 |date=2006 |journal=Integers |volume=6 |issue=A38}}
* {{Cite journal |last1=Kravitz |first1=N. |doi=10.5070/C61055383 |title=Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem |journal=Combinatorial Theory |volume=1 |year=2021 |arxiv=1912.06034|s2cid=245100000 }}
* {{cite journal |last1=Perarnau |first1=Guillem |last2=Serra |first2=Oriol |title=Correlation among runners and some results on the lonely runner conjecture |journal=[[The Electronic Journal of Combinatorics]] |date=March 2016 |volume=23 |issue=1 |pages=P1.50 |doi=10.37236/5123|s2cid=7039062 |doi-access=free |arxiv=1407.3381 }}
* {{Cite journal |last1=Renault |first1=J. |doi=10.1016/j.disc.2004.06.008 |title=View-obstruction: A shorter proof for 6 lonely runners |journal=[[Discrete Mathematics (journal)|Discrete Mathematics]] |volume=287 |pages=93–101 |year=2004 |issue=1–3 |url=https://basepub.dauphine.fr/handle/123456789/6201 |doi-access=free}}
* {{Cite journal |last1=Rifford |first1=L. |title=On the time for a runner to get lonely | url = https://arxiv.org/pdf/2111.13688.pdf |journal=Acta Applicandae Mathematicae |volume=180 |pages= Paper No. 15 | year=2022 |doi=10.1007/s10440-022-00515-9}}
| |||