𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the chromatic number of ℝ9

✍ Scribed by A. B. Kupavskii; A. M. Raigorodskii

Publisher
Springer US
Year
2009
Tongue
English
Weight
165 KB
Volume
163
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the mean chromatic number
On the mean chromatic number
✍ Martin Anthony 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 209 KB

The mean chromatic number of a graph is a measure of the expected performance of the greedy vertex-colouring algorithm when each ordering of the vertices is equally likely. Some results on the value of the mean chromatic number and its asymptotic behaviour are presented.

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 oriented chromatic number of grid
On the oriented chromatic number of grids
✍ Guillaume Fertin; André Raspaud; Arup Roychowdhury 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 111 KB

In this paper, we focus on the oriented coloring of graphs. Oriented coloring is a coloring of the vertices of an oriented graph G without symmetric arcs such that (i) no two neighbors in G are assigned the same color, and (ii) if two vertices u and v such that (u, v) ∈ A(G) are assigned colors c(u)