✦ LIBER ✦

Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I

✍ Scribed by Hans-Dietrich O.F. Gronau

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 519 KB
Volume: 37
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90140-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Triangular embeddings of complete graphs

Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices

✍ M. N. Ellingham; Chris Stephens 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

In this paper, we describe the generation of all nonorientable triangular embeddings of the complete graphs K 12 and K 13 . (The 59 nonisomorphic orientable triangular embeddings of K 12 were found in 1996 by Altshuler, Bokowski, and Schuchert, and K 13 has no orientable triangular embeddings.) Ther

On labeling the vertices of products of

On labeling the vertices of products of complete graphs with distance constraints

✍ D.J. Erwin; J.P. Georges; D.W. Mauro 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 71 KB

New Constructions of Bipartite Graphs on

New Constructions of Bipartite Graphs on m, n Vertices with Many Edges and Without Small Cycles

✍ F. Lazebnik; V.A. Ustimenko; A.J. Woldar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 293 KB