• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Chromatic number of integral distance graph

Li, 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.1031 seconds