𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Every regular graph is a quasigroup graph

✍ Scribed by W. Dörfler

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
344 KB
Volume
10
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

~~r~h-~~lland Publishing Company Receiwd 4 kbrurary 1974 * ph-them-etic tei7ninolcllgy use in this nste, see [ 21; for alge-; a gxoupoid (i.e., a set with a binary mmposition) in whi rary two eleme the equations 42s = b and 332 =t I ueiy defined s d ~7. Since associative quasigroups are gmups, the main interest is in the nonassociative case.

📜 SIMILAR VOLUMES

Every connected graph is a query graph
Every connected graph is a query graph
✍ Peter M. Winkler 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB

Let Vbe a set of bit strings of length k, i.e., V C {0, l}'. The query graph Q ( V ) is defined as follows: the vertices of Q(V) are the elements of V, and {O,V} is an edge of Q ( V ) if and only if no other W E Vagrees with U in all the positions in which V does. If Vrepresents the set of keys for

Every Graph Is an Integral Distance Grap
Every Graph Is an Integral Distance Graph in the Plane
✍ Hiroshi Maehara; Katsuhiro Ota; Norihide Tokushige 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 290 KB

We prove that every finite simple graph can be drawn in the plane so that any two vertices have an integral distance if and only if they are adjacent. The proof is constructive.

Every Planar Graph Is 5-Choosable
Every Planar Graph Is 5-Choosable
✍ C. Thomassen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 56 KB

We prove the statement of the title, which was conjectured in 1975 by V. G. Vizing and, independently, in 1979 by P. Erdös, A. L. Rubin, and H. Taylor. (i) 1994 Academic Press, Inc.