Chromatic numbers of integer distance graphs (Q5936034): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q127212410, #quickstatements; #temporary_batch_1724838735603 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(00)00243-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074030300 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127212410 / rank | |||
Normal rank | |||
Latest revision as of 10:55, 28 August 2024
scientific article; zbMATH DE number 1612894
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chromatic numbers of integer distance graphs |
scientific article; zbMATH DE number 1612894 |
Statements
Chromatic numbers of integer distance graphs (English)
0 references
22 July 2002
0 references
An integer distance graph is a graph \(G(D)\) with the set of integers as the vertex set and with an edge joining two vertices \(a\) and \(b\) iff \(|a-b|\in D\), where \(D\) is a subset of the positive integers. The authors determine the chromatic numbers of integer distance graphs (i) if \(D\) consists of two different positive integers together with their sum and their (positive) differences and (ii) with finite or infinite distance sets which are arithmetical sequences.
0 references
integer distance graph
0 references
chromatic numbers
0 references
