𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Data Problem for Color Objectivism

✍ Scribed by Donald D. Hoffman

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
20 KB
Volume
10
Category
Article
ISSN
1053-8100

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A data set for color research
A data set for color research
✍ Kobus Barnard; Lindsay Martin; Brian Funt; Adam Coath πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 90 KB
An edge coloring problem for graph produ
An edge coloring problem for graph products
✍ Faudree, R. J.; GyοΏ½rfοΏ½s, AndrοΏ½as; Schelp, R. H. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 315 KB πŸ‘ 1 views

The edges of the Cartesian product of graphs G x H a r e to be colored with the condition that all rectangles, i.e., K2 x K2 subgraphs, must be colored with four distinct colors. The minimum number of colors in such colorings is determined for all pairs of graphs except when G is 5-chromatic and H

On an Extremal Problem for Colored Trees
On an Extremal Problem for Colored Trees
✍ P. Valtr πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 93 KB

Let T be a tree such that there is a proper n-coloring c of the vertices of T which, besides a technical condition, is a k b k a k -free, i.e., T contains no subdivision of a path u 1 , . . . , Then T has O(kn) vertices. (The technical condition requires that T contains no subdivision of a properly