𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New Results on the Queens_n2Graph Coloring Problem

✍ Scribed by Michel Vasquez

Book ID
111584193
Publisher
Springer US
Year
2004
Tongue
English
Weight
119 KB
Volume
10
Category
Article
ISSN
1381-1231

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

New bounds on a hypercube coloring probl
New bounds on a hypercube coloring problem
✍ Hung Quang Ngo; Ding-Zhu Du; Ronald L. Graham πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 57 KB

In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices whose Hamming distance is at most k are colored differently. Determining the exact value of Ο‡ k (n), the minimum number of

On the max coloring problem
On the max coloring problem
✍ Epstein, Leah; Levin, Asaf πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 380 KB
Some new results on 1-rotational 2-facto
Some new results on 1-rotational 2-factorizations of the complete graph
✍ Tommaso Traetta πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 129 KB πŸ‘ 1 views

## Abstract It is known that a necessary condition for the existence of a 1‐rotational 2‐factorization of the complete graph __K__~2__n__+1~ under the action of a group __G__ of order 2__n__ is that the involutions of __G__ are pairwise conjugate. Is this condition also sufficient? The complete ans

On the max-weight edge coloring problem
On the max-weight edge coloring problem
✍ Giorgio Lucarelli; Ioannis Milis; Vangelis T. Paschos πŸ“‚ Article πŸ“… 2009 πŸ› Springer US 🌐 English βš– 416 KB
The permutation-path coloring problem on
The permutation-path coloring problem on trees
✍ Sylvie Corteel; Mario Valencia-Pabon; DaniΓ¨le Gardy; Dominique Barth; Alain Deni πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 292 KB

In this paper we ΓΏrst show that the permutation-path coloring problem is NP-hard even for very restrictive instances like involutions, which are permutations that contain only cycles of length at most two, on both binary trees and on trees having only two vertices with degree greater than two, and f