Atlas home || Conferences | Abstracts | about Atlas

Czech and Slovak Conference GRAPHS 2000
May 15-19, 2000
Matej Bel University in Banská Bystrica
Liptovský Trnovec, Slovakia

Organizers
Roman Nedela

View Abstracts
Conference Homepage

Decompositions of Multigraphs into Parts with Two Edges
by
M. Meszka
Kraków
Coauthors: J. Ivanco (Kraków), Z. Skupien (Kraków)

Given a family F of multigraphs, a multigraph M is called F-decomposable if M is an edge disjoint union of multigraphs each of which is isomorphic to a member of F. We present necessary and sufficient conditions for existence of such decompositions if F={H1} or F={H1,  H2} and the size of Hi is two, i=1,  2. Moreover, improving on Caro's general polynomial characterizations, we provide a method of reducing the problem if a multigraph M is F-decomposable into parts with two edges to finding a perfect matching in modified line graphs of M.

Date received: May 26, 2000

Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafd-13.