✦ LIBER ✦

A proof of Golomb's conjecture for the de Bruijn graph

✍ Scribed by Johannes Mykkeltveit

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 261 KB
Volume: 13
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(72)90006-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A proof of the substitution lemma in de

A proof of the substitution lemma in de Bruijn's notation

✍ Hiroshi Ohtsuka 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Proof of the strong 2-Cover Conjecture f

Proof of the strong 2-Cover Conjecture for planar graphs

✍ Herbert Fleischner 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 76 KB

Polynomials and packings: A new proof of

Polynomials and packings: A new proof of de Bruijn's theorem

✍ Paul Boisen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 119 KB

In 1969 de Bruijn published a proof of the following fact: An a x ab x abc brick can be used to pack an A x B x C box if, and only if, the integers A, B, C are in some order a multiple of a, a multiple of ab, and a multiple of abc. We give a quick proof of this result based on the following elementa

A proof of Schafer's conjecture for infi

A proof of Schafer's conjecture for infinite-dimensional forms admitting composition

✍ Kevin McCrimmon 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 609 KB

The Erdős-Sós conjecture for graphs of g

The Erdős-Sós conjecture for graphs of girth 5

✍ Stephan Brandt; Edward Dobson 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 167 KB

A generalization of a theorem of de Brui

A generalization of a theorem of de Bruijn and Erdös on the chromatic number of infinite graphs

✍ John Lake 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 283 KB