| Partition of a Travel into Circuits |
| Received:November 14, 1998 |
| Key Words:
circuit partition travel Eulerian graph
|
| Fund Project:Supported by National Natural Science Foundation of China (19831080) |
|
| Hits: 2319 |
| Download times: 1351 |
| Abstract: |
| 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， |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.2001.04.006 |
| View Full Text View/Add Comment |
