摘要
In this paper, a sufficient condition to partition a travel into circuits of length at least 3 is provided， In particular, a necessary and sufficient condition to partition a planar travel into such circuits, which can he verified in polynomial time, is provided，
给出了将迂分解为若干个长度至少为３的圈的一个充分条件，特别地，给出了平面迂具有该分解的可在多项式时间内验证之充分必要条件，
基金
Supported by National Natural Science Foundation of China(19831080)
