𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Péter Komjáth

Publisher
Springer
Year
2009
Tongue
English
Weight
223 KB
Volume
45
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The fractional chromatic number of infin
The fractional chromatic number of infinite graphs
✍ Imre Leader 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 398 KB 👁 1 views

## Abstract The fractional chromatic number of a graph __G__ is the infimum of the total weight that can be assigned to the independent sets of __G__ in such a way that, for each vertex __v__ of __G__, the sum of the weights of the independent sets containing __v__ is at least 1. In this note we g

On the chromatic number of disk graphs
On the chromatic number of disk graphs
✍ Malesi?ska, Ewa; Piskorz, Steffen; Wei�enfels, Gerhard 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB 👁 2 views

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their

On the cost-chromatic number of graphs
On the cost-chromatic number of graphs
✍ John Mitchem; Patrick Morriss 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 566 KB

We consider vertex colorings in which each color has an associated cost, incurred each time the color is assigned to a vertex. For a given set of costs, a minimum-cost coloring is a vertex coloring which makes the total cost of coloring the graph as small as possible. The cost-chromatic number of a

On the chromatic number of cube-like gra
On the chromatic number of cube-like graphs
✍ Charles Payan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 343 KB

A cube-like graph is a graph whose vertices are all 2" subsets of a set E of cardinality n, in which two vertices are adjacent if their symmetric difference is a member of a given specified collection of subsets of E. Many authors were interested in the chromatic number of such graphs and thought it

On the chromatic number of special dista
On the chromatic number of special distance graphs
✍ M. Voigt; H. Walther 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 153 KB

## A b&act Voigt, M. and H. Walther, On the chromatic number of special distance graphs, Discrete Mathematics 97 (1991) 395-397. For all 12 10 and u 2 1' -61+ 3 the chromatic number is proved to be 3 for distance graphs with all integers as vertices, and edges only if the vertices are at distance