Chromatic number of graphs with special distance sets, I

• Дата: 2018
• Автор: Yegnanarayanan, V.
• Формат: Стаття
• Мова: Англійська
• Опубліковано: Lugansk National Taras Shevchenko University 2018
• Теми: chromatic number; prime distance graph; unit distance graph; 05C15
• Онлайн доступ: https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1028
• Назва журналу: Algebra and Discrete Mathematics

Given a subset \(D\) of positive integers, an integer distance graph is a graph \(G(\mathbb{Z}, D)\) with the set \(\mathbb{Z}\) of integers as vertex set and with an edge joining two vertices \(u\) and \(v\) if and only if \(|u - v| \in D\). In this paper we consider the problem of determining the...