✦ LIBER ✦

On the packing chromatic number of hypercubes

✍ Scribed by Torres, Pablo; Valencia-Pabon, Mario

Book ID: 122285171
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 190 KB
Volume: 44
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2013.10.041

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing chromatic number of distance gra

Packing chromatic number of distance graphs

✍ Jan Ekstein; Přemysl Holub; Bernard Lidický 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 514 KB

On the Achromatic Number of Hypercubes

✍ Yuval Roichman 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 96 KB

The achromatic number of a finite graph G, (G), is the maximum number of independent sets into which the vertex set may be partitioned, so that between any two parts there is at least one edge. For an m-dimensional hypercube P m 2 we prove that there exist constants 0<c 1 <c 2 , independent of m, su

An improved lower bound for the radio -c

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

✍ Srinivasa Rao Kola; Pratima Panigrahi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 355 KB

On the difference between chromatic numb

On the difference between chromatic number and dynamic chromatic number of graphs

✍ A. Ahadi; S. Akbari; A. Dehghan; M. Ghanbari 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 200 KB

On the mean chromatic number

✍ Martin Anthony 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 209 KB

The mean chromatic number of a graph is a measure of the expected performance of the greedy vertex-colouring algorithm when each ordering of the vertices is equally likely. Some results on the value of the mean chromatic number and its asymptotic behaviour are presented.

On the queue-number of the hypercube

✍ Petr Gregor; Riste Škrekovski; Vida Vukašinović 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 180 KB