✦ LIBER ✦

On Split-Coloring Problems

✍ Scribed by T. Ekim; D. de Werra

Publisher: Springer US
Year: 2005
Tongue: English
Weight: 323 KB
Volume: 10
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-005-4103-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Probabilistic graph-coloring in bipartit

Probabilistic graph-coloring in bipartite and split graphs

✍ N. Bourgeois; F. Della Croce; B. Escoffier; C. Murat; V. Th. Paschos 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 790 KB

On a splitting problem

✍ Imre Patyi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 French ⚖ 80 KB

We show that any short exact sequence 0 → K → Ω × C n → Ω × C m → 0 of holomorphic vector bundles splits over a pseudoconvex open subset Ω of a Banach space which has a countable unconditional basis.

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

On an interval splitting problem

✍ F.Thomas Bruss; S.Rao Jammalamadaka; Xian Zhou 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 247 KB

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

Some undecidable problems involving the

Some undecidable problems involving the edge-coloring and vertex-coloring of graphs

✍ Stefan A. Burr 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 477 KB

Certain problems involving the coloring the edges or vertices of infinite graphs are shown to be undecidable. In particular, let G and H be finite 3-connected graphs, or triangles. Then a doubly-periodic infinite graph F is constructed such that the following problem is undecidable: For a coloring o