𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improved lower bound for the radio -chromatic number of the hypercube

✍ Scribed by Srinivasa Rao Kola; Pratima Panigrahi

Book ID
108078586
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
355 KB
Volume
60
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An improved bound for the strong chromat
An improved bound for the strong chromatic number
✍ P. E. Haxell πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 156 KB πŸ‘ 1 views

## Abstract Let η > 0 be given. Then there exists __d__~0~ = __d__~0~(Ξ·) such that the following holds. Let __G__ be a finite graph with maximum degree at most __d__ β‰₯ __d__~0~ whose vertex set is partitioned into classes of size Ξ± __d__, where Ξ±β‰₯ 11/4 + η. Then there exists a proper coloring of __

An improved upper bound on the crossing
An improved upper bound on the crossing number of the hypercube
✍ Luerbio Faria; Celina Miraglia Herrera de Figueiredo; Ondrej SΓ½kora; Imrich Vrt' πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 288 KB

## Abstract We draw the __n__‐dimensional hypercube in the plane with ${5\over 32}4^{n}-\lfloor{{{{n}^{2}+1}\over 2}}\rfloor {2}^{n-2}$ crossings, which improves the previous best estimation and coincides with the long conjectured upper bound of ErdΓΆs and Guy. Β© 2008 Wiley Periodicals, Inc. J Graph

Improved bounds for the chromatic number
Improved bounds for the chromatic number of a graph
✍ S. Louis Hakimi; Edward Schmeichel πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 97 KB πŸ‘ 2 views

## Abstract After giving a new proof of a well‐known theorem of Dirac on critical graphs, we discuss the elegant upper bounds of Matula and Szekeres‐Wilf which follow from it. In order to improve these bounds, we consider the following fundamental coloring problem: given an edge‐cut (__V__~1~, __V_