PROOF OF A CONJECTURE ON MATROID BASE GRAPHS
摘要
Let G be the base graph of a matroid. L et k(G),λ(G) and δ(G)denote the connectivity edge-connectivity and the minimum degree of G, respectively. The conjecture that k(G)= λ(G)=δ(G) is proved true for any matroid.
引用本文（GB/T 7714）
Liu G. PROOF OF A CONJECTURE ON MATROID BASE GRAPHS[J]. 未知来源, 1990.
引文网络
本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。