Chromatic number of graphs with special distance sets, I
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...
Gespeichert in:
| Datum: | 2018 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Lugansk National Taras Shevchenko University
2018
|
| Schlagworte: | |
| Online Zugang: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1028 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Algebra and Discrete Mathematics |