Finite prime distance graphs and 2-odd graphs
Authors:
- Joshua D. LaisonJLJoshua D. Laison
- Colin StarrCSColin Starr
- Andrea WalkerAWAndrea Walker
- 1 October 2013
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 313 (20) , 2281-2291
Abstract
No abstract availableAll Related Versions
This publication has 6 references indexed in Scilit:
- The primes contain arbitrarily long arithmetic progressionsAnnals of Mathematics, 2008
- On a question concerning prime distance graphsDiscrete Mathematics, 2002
- Chromatic number of prime distance graphsDiscrete Applied Mathematics, 1994
- Colouring prime distance graphsGraphs and Combinatorics, 1990
- ErratumJournal of Combinatorial Theory, Series B, 1986
- Colouring the real lineJournal of Combinatorial Theory, Series B, 1985