科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper proves that the graphic matroids of the title with at least two edges and no isolated vertices coincide with the class of complete k-partite graphs where, when k %26lt;= 3, no partition class has size one. It also shows that a simple rank-r binary matroid M has every two elements in a 4-circuit if vertical bar E(M)vertical bar %26gt;= 2(r-1) + 2.
- 出版日期2013-10
