The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Decompositions of multigraphs into parts with two edges”

Decompositions of multigraphs into parts with the same size

Jaroslav Ivanco (2010)

Discussiones Mathematicae Graph Theory

Similarity:

Given a family ℱ of multigraphs without isolated vertices, a multigraph M is called ℱ-decomposable if M is an edge disjoint union of multigraphs each of which is isomorphic to a member of ℱ. We present necessary and sufficient conditions for existence of such decompositions if ℱ consists of all multigraphs of size q except for one. Namely, for a multigraph H of size q we find each multigraph M of size kq, such that every partition of the edge set of M into parts of cardinality q contains...