✦ LIBER ✦

Quadrangular embeddings of the complete even k-partite graph

✍ Scribed by Nora Hartsfield; Gerhard Ringel

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 240 KB
Volume: 81
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90175-h

No coin nor oath required. For personal study only.

✦ Synopsis

The complete even k-partite graph K n,.n* ,..., "* is the complete k-partite graph where all the n,'s are even numbers. Orientable and nonorientable quadrangular embeddings are constructed for all these graphs.

📜 SIMILAR VOLUMES

Cyclic even cycle systems of the complet

Cyclic even cycle systems of the complete graph

✍ Shung-Liang Wu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB 👁 1 views

## Abstract In this article, it is proved that for each even integer __m__⩾4 and each admissible value __n__ with __n__>2__m__, there exists a cyclic __m__‐cycle system of __K__~__n__~, which almost resolves the existence problem for cyclic __m__‐cycle systems of __K__~__n__~ with __m__ even. © 201

On biclique partitions of the complete g

On biclique partitions of the complete graph

✍ Bryan L. Shader 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 930 KB

On the number of triangular embeddings o

On the number of triangular embeddings of complete graphs and complete tripartite graphs

✍ M. J. Grannell; M. Knor 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

## Abstract We prove that for every prime number __p__ and odd __m__>1, as __s__→∞, there are at least __w__ face 2‐colorable triangular embeddings of __K__~__w, w, w__~, where __w__ = __m__·__p__^__s__^. For both orientable and nonorientable embeddings, this result implies that for infinitely many

The generating function of irreducible c

The generating function of irreducible coverings by edges of complete k-partite graphs

✍ Virgil Domocos; Ş.N. Buzeţeanu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 208 KB

A generalization of a recent result of Tomescu ( 1993) is presented. The method is purely combinatorial and is based on the theory of species of several variables.

Note on the existence of directed (k + 1

Note on the existence of directed (k + 1)-cycles in diconnected complete k-partite digraphs

✍ R. Balakrishnan; P. Paulraja 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

A graph is constructed to provide a negative answer to the following question of Bondy: Does every diconnected orientation of a complete k-partite (k 2 5) graph with each part of size at least 2 yield a directed (k + 1)-cycle?

On the decomposition of Kn into complete

On the decomposition of Kn into complete m-partite graphs

✍ Qingxue Huang 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB 👁 1 views

## Abstract Graham and Pollak [3] proved that __n__ −1 is the minimum number of edge‐disjoint complete bipartite subgraphs into which the edges of __K__~__n__~ can be decomposed. Using a linear algebraic technique, Tverberg [2] gives a different proof of that result. We apply his technique to show