1 |
Chromatic number of integral distance graphLi, fu-qun 13 February 2001 (has links)
Abstract
For a set D of positive integers, the integral distance graph G(Z, D) is the graph with vertex set Z and edge set { xy : x, y 2 Z and | x − y | 2 D } . An integral distance graph G(Z, D) is called ¡§locally dense¡¨ if the clique size of G(Z, D) is not less to | D | . This paper acterizes
locally dense integral distance graphs and determine their chromatic numbers.
|
Page generated in 0.097 seconds