𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering and coloring problems for relatives of intervals

✍ Scribed by A. Gyárfás; J. Lehel

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
800 KB
Volume
55
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On covering and coloring problems for ro
On covering and coloring problems for rook domains
✍ Walter Alexandre Carnielli 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 456 KB

Given the set V~ of all vectors with length n and components 0, 1 ..... k -1 from the ring of the integers modulo k, the Hamming distance H(X, Y) between X, Y ~ V~ is defined as the number of components in which X and Y differ, and the j-dimensional rook domain of X ~ V~ is defined as the set of vec

Parallel Algorithms for the Edge-Colorin
Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems
✍ Weifa Liang; Xiaojun Shen; Qing Hu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 342 KB

In fact, Vizing's proof implies an O(nm) time algorithm with ⌬ ϩ 1 colors for the edge-coloring problem. However, Holyer has shown that deciding whether a graph requires ⌬ or ⌬ ϩ 1 colors is NP-complete [10]. For a multigraph G, Shannon showed that Ј(G) Յ 3⌬/2 [16]. A number of parallel algorithms