The List-Chromatic Number of Infinite Graphs Defined on Euclidean Spaces

Abstract  If D is a countable set of positive reals, 2≤n<ω, let X

_n
(D) be the graph with the points of R

ⁿ
as vertices where two vertices are joined iff their distance is in D. We determine the list-chromatic number of X

_n
(D) as much as possible.

• Content Type Journal Article
• DOI 10.1007/s00454-009-9228-5
• Authors
  
  
  • Péter Komjáth, Eötvös University Department of Computer Science P.O. Box 120 Budapest 1518 Hungary
  
  

• Journal Discrete and Computational Geometry
• Online ISSN 1432-0444
• Print ISSN 0179-5376

Published by

Original source : http://www.springerlink.com/content/f44822267r2087...