把多重图M转化为简单图L^*(M),再利用已有随机P3-可分解简单图和随机可匹配简单图的相关结论,建立M和L^*(M)之间随机P3-可分解和随机可匹配的等价关系.通过对多重图是否含圈进行分情形讨论,刻画出所有随机P3-可分解的多重图.
With the multigraphMbeing transformed into a simple graphL^*(M),making use of some related results about randomly P3-decomposable graphs and randomly matchable graphs,an equivalence relation between randomP3-decomposition and random matching is founded.Mis discussed on the condition that if it has a cycle or not,and all randomlyP3-decomposable multigraphs are characterized and classified.