✦ LIBER ✦

Perfect 2-colorings of a hypercube

✍ Scribed by D. G. Fon-Der-Flaass

Book ID: 106530248
Publisher: SP MAIK Nauka/Interperiodica
Year: 2007
Tongue: English
Weight: 123 KB
Volume: 48
Category: Article
ISSN: 0037-4466
DOI: 10.1007/s11202-007-0075-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perfect 2-colorings of transitive cubic

Perfect 2-colorings of transitive cubic graphs

✍ S. V. Avgustinovich; M. A. Lisitsyna 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 515 KB

Polychromatic Colorings of Subcubes of t

Polychromatic Colorings of Subcubes of the Hypercube

✍ Offner, David 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 155 KB

On perfect 2-colorings of the -ary -cube

✍ Vladimir N. Potapov 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 192 KB

On a hypercube coloring problem

✍ Patric R.J. ÖstergÅrd 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 167 KB

On Perfect 2-Colorings of Johnson Graphs

On Perfect 2-Colorings of Johnson Graphs J(v,3)

✍ Alexander L. Gavrilyuk; Sergey V. Goryainov 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 618 KB

The number of perfect matchings in a hyp

The number of perfect matchings in a hypercube

✍ Niall Graham; Frank Harary 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 243 KB

A perfect matching or a l-factor of a graph G is a spanning subgraph that is regular of degree one. Hence a perfect matching is a set of independent edges which matches all the nodes of G in pairs. Thus in a hypercube parallel processor, the number of perfect matchings evaluates the number of diff