Matroids and graphs with few non-essential elements

被引:0
|
作者
Oxley, J [1 ]
Wu, HD
机构
[1] Louisiana State Univ, Dept Math, Baton Rouge, LA 70803 USA
[2] Southern Univ, Dept Math, Baton Rouge, LA 70813 USA
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
An essential element of a 3-connected matroid M is one for which neither the deletion nor the contraction is 3-connected. Tutte's Wheels and Whirls Theorem proves that the only 3-connected matroids in which every element is essential are the wheels and whirls. In an earlier paper, the authors showed that a 3-connected matroid with at least one nonessential element has at least two such elements. This paper completely determines all 3-connected matroids with exactly two non-essential elements. Furthermore, it is proved that every 3-connected matroid M for which no single-element contraction is 3-connected can be constructed from a similar such matroid whose rank equals the rank in M of the set of elements e for which the deletion M\e is 3-connected.
引用
收藏
页码:199 / 229
页数:31
相关论文
共 50 条