𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Virgil Domocos; Ş.N. Buzeţeanu

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
208 KB
Volume
147
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

On the number of irreducible coverings b
On the number of irreducible coverings by edges of complete bipartite graphs
✍ Ioan Tomescu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 102 KB

In this paper it is proved that the exponential generating function of the numbers, denoted by N(p, q), of irreducible coverings by edges of the vertices of complete bipartite graphs Kp.q equals exp(xe r + ye x -x -y -xy) -t.

Quadrangular embeddings of the complete
Quadrangular embeddings of the complete even k-partite graph
✍ Nora Hartsfield; Gerhard Ringel 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 240 KB

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.

s-Regular cubic graphs as coverings of t
s-Regular cubic graphs as coverings of the complete bipartite graph K3,3
✍ Yan-Quan Feng; Jin Ho Kwak 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB

## Abstract A graph is __s‐regular__ if its automorphism group acts freely and transitively on the set of __s__‐arcs. An infinite family of cubic 1‐regular graphs was constructed in [10], as cyclic coverings of the three‐dimensional Hypercube. In this paper, we classify the __s__‐regular cyclic cov

Covering the Edges of a Connected Graph
Covering the Edges of a Connected Graph by Paths
✍ L. Pyber 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 316 KB

We prove that every connected graph on n vertices can be covered by at most nÂ2+O(n 3Â4 ) paths. This implies that a weak version of a well-known conjecture of Gallai is asymptotically true.