搜索结果: 1-1 共查到“数学 Knot theory”相关记录1条 . 查询时间(0.579 秒)
On a Planarity Criterion Coming from Knot Theory
Planarity Criterion Knot Theory
font style='font-size:12px;'>
2010/11/1
A graph G is called "minimalizable" if a diagram with minimal crossing number can be obtained from an arbitrary diagram of G by crossing changes. If, furthermore, the minimal diagram is unique up to ...