【摘要】 本文给出赋权欧拉图无公共边均匀初级圈覆盖,M—均匀初级圈覆盖,最小均匀覆盖的概念,并给出求它们的相应算法.此文所给出的算法同样适用于有向欧拉图.更多还原

【Abstract】 This paper introduces the concepts of homogeneous cycle-coverings and M-homogeneous cycle-coverings of an Eulerian graph and presents an algorithm for generating all edge-disjoint homogeneous cycle-coverings of an Eulerian graph by depth-firstsearch. The algorithm is also suitable to an Eulerian digraph.更多还原