董进全,刘彦佩.迂的圈分解(英文)[J].数学研究及应用,2001,21(4):505~512 |
迂的圈分解(英文) |
Partition of a Travel into Circuits |
投稿时间:1998-11-14 |
DOI:10.3770/j.issn:1000-341X.2001.04.006 |
中文关键词: |
英文关键词:circuit partition travel Eulerian graph |
基金项目: |
|
摘要点击次数: 2222 |
全文下载次数: 1288 |
中文摘要: |
给出了将迂分解为若干个长度至少为3的圈的一个充分条件,特别地,给出了平面迂具有该分解的可在多项式时间内验证之充分必要条件, |
英文摘要: |
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, |
查看全文 查看/发表评论 下载PDF阅读器 |