Return to search

Chromatic number of integral distance graph

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.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0213101-134241
Date13 February 2001
CreatorsLi, fu-qun
ContributorsChia-Hsin Liu, Tsai-Lien Wong, Xuding Zhu, D. J. Guan
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0213101-134241
Rightsunrestricted, Copyright information available at source archive

Page generated in 0.0019 seconds