𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Number Of Unique-Sink Orientations of the Hypercube*

✍ Scribed by Jiří Matoušek

Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
165 KB
Volume
26
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unique Sink Orientations of Grids
Unique Sink Orientations of Grids
✍ Bernd Gärtner; Walter D. Jr. Morris; Leo Rüst 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 693 KB
On the Achromatic Number of Hypercubes
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

On the galactic number of a hypercube
On the galactic number of a hypercube
✍ Michael Fellows; Mark Hoover; Frank Harary 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 298 KB

A galaxy is a union of vertex disjoint stars. The galactic number of a graph is the minimum number of galaxies which partition the edge set. The galactic number of complete graphs is determined. This result is used to give bounds on the galactic number of binary cube graphs. The problem of determini

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