排序方式: 共有1条查询结果,搜索用时 15 毫秒
1
1.
Let G be the circuit graph of any connected matroid. We prove that G is edge-pancyclic if it has at least three vertices.
This work is supported by the National Natural Science Foundation(60673047) and the Doctoral Program Foundation of Education
Ministry (20040422004) of China. 相似文献
1