The List-Chromatic Number of Infinite Graphs Defined on Euclidean Spaces |
| |
Authors: | Péter Komjáth |
| |
Institution: | 1.Department of Computer Science,E?tv?s University,Budapest,Hungary |
| |
Abstract: | If D is a countable set of positive reals, 2≤n<ω, let X
n
(D) be the graph with the points of R
n
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|