Can I read The solution of the bipartite analogue of the Oberwolfach problem on EtoBox?

The solution of the bipartite analogue of the Oberwolfach problem by W.L. Piotrowski is a Computer Science article available to read on EtoBox.

What is The solution of the bipartite analogue of the Oberwolfach problem about?

Piotrowski, W.L., The solution of the bipartite analogue of the Oberwolfach problem, Discrete Mathematics 97 (1991) 339-356. path joins x0 with x, (e = 0 is allowed). Similarly, cycle (x0, . . . , q-l) denotes the cycle with the k edges {xi, xi+r} (i = 0, . . . , k -2), {x~-~, x,,} (k must be 23 and xi # Xj whenever i # j). (iii) For a graph G and a non-empty set A4 let G(M) denote the graph with ## (b, Y)> ) {a> b) E E(G), x, Y EM}; for n 2 1 we use also the notation G(n) for any graph G(M) with ]MI = n. (iv) We use the standard notation K,, for a complete graph on it vertices, K,,, for a complete bipartite graph on two independent sets of each n vertices, and P, and C, for the path, respectively cycle, with e edges. C,,, ~~, , ak denotes each graph which is a vertex-disjoint union of k cycles C,,, C,,, . . . , C,,. Factorisations 0.3. (i) If G, F; (i E Z) are graphs then the notation G = Ci,,e always means that G is the union of the graphs 4 and these 4 are pairwise edge-disjoint. If G = Ciel & holds and each E is a factor of G (i.e. V(E) = V(G)), we say also that (&)i,, is a fucforisution of G. (ii) If F, G are graphs such that a family @ = (u~)~,, of the bijections q:V(F)+ V(G)

Who reads The solution of the bipartite analogue of the Oberwolfach problem?

Author

W.L. Piotrowski

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)

Published

1991

Language

EN

Field

Computer Science (Physical Sciences)