Finite prime distance graphs and 2-odd graphs

DOI10.1016/j.disc.2013.06.005zbMath1281.05121arXiv2106.02177OpenAlexW2072887960MaRDI QIDQ390314

Joshua D. Laison, Andrea Walker, Colin L. Starr

Publication date: 23 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.02177

zbMATH Keywords

distance graphsdifference graphsprime distance graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Prime power and prime product distance graphs ⋮ On finite prime distance graphs

Cites Work

• Colouring the real line
• Colouring prime distance graphs
• Chromatic number of prime distance graphs
• On a question concerning prime distance graphs
• A dynamic survey of graph labeling
• The primes contain arbitrarily long arithmetic progressions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite prime distance graphs and 2-odd graphs