Randomly Mt−decomposable Multigraphs and M2−equipackable Multigraphs
نویسنده
چکیده
A graph G is called randomly H − decomposable if every maximal H − packing in G uses all edges in G. G is called H − equipackable if every maximal H − packing in G is also a maximum H − packing in G. M2 − decomposable graphs, randomly M2 − decomposable graphs and M2 − equipackable graphs have been characterized. The definitions could be generalized to multigraphs. And M2 − decomposable multigraphs has been characterized. In this paper, all randomly M2 − decomposable multigraphs and M2 − equipackable multigraphs are characterized, and some notes about randomly Mt − decomposable multipraphs are given. Key–Words: Multigraph, packing, decomposable, randomly decomposable, equipackable, matching.
منابع مشابه
The complete multigraphs and their decompositions into open trails
Balister [Combin. Probab. Comput. 12 (2003), 1–15] gave a necessary and sufficient condition for a complete multigraph Kn to be arbitrarily decomposable into closed trails of prescribed lengths. In this article we solve the corresponding problem showing that the multigraphs Kn are arbitrarily decomposable into open trails.
متن کاملDecompositions of multigraphs into parts with two edges
Given a family F of multigraphs without isolated vertices, 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 the existence of such decompositions if F comprises two multigraphs from the set consisting of a 2-cycle, a 2-matching and a path with two edges.
متن کاملDecompositions of multigraphs into parts with the same size
Given a family F of multigraphs without isolated vertices, 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 consists of all multigraphs of size q except for one. Namely, for a multigraph H of size q we find each multigraph M...
متن کاملEdge-disjoint Open Trails in Complete Bipartite Multigraphs
Let Ka,b be a complete bipartite multigraph. We show a necessary and sufficient condition for a multigraph Ka,b to be arbitrarily decomposable into open trails. A motivation for us to investigated this problem is a paper of Balister [1].
متن کاملA Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs
Many combinatorial problems can be efficiently solved for series]parallel multigraphs. However, the edge-coloring problem of finding the minimum number of colors required for edge-coloring given graphs is one of a few well-known combinatorial problems for which no efficient algorithms have been obtained for series]parallel multigraphs. This paper gives a linear algorithm for the problem on seri...
متن کامل