𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The proof of Ushio’s conjecture concerning path factorization of complete bipartite graphs

✍ Scribed by Beiliang Du; Jian Wang

Book ID
107347383
Publisher
SP Science China Press
Year
2006
Tongue
English
Weight
205 KB
Volume
49
Category
Article
ISSN
1674-7283

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solution of fink & straight conjecture o
Solution of fink & straight conjecture on path-perfect complete bipartite graphs
✍ Weiting Cao; Peter Hamburger 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 1 views

## Abstract We consider various edge disjoint partitions of complete bipartite graphs. One case is where we decompose the edge set into edge disjoint paths of increasing lengths. A graph __G__ is __path‐perfect__ if there is a positive integer __n__ such that the edge set __E__(__G__) of the graph

The isomorphic factorization of complete
The isomorphic factorization of complete tripartite graphs K (m, n, s) - a proof of F. Harary, R.W. Robinson and N.C. Wormald's conjecture
✍ Shihui Yang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 623 KB

Harary, Robinson and Wormald (1978) proved that for a complete tripartite graph G = K(m,n,s) if t = 2 or 4 and tl(mn + ms + ns), then G has an isomorphic factorization into t isomorphic subgraphs, written as t[ G. They also proved that the analogous statement is false for all odd t > 1. They conject