Skip to main content
Log in

Matroids and Graphs with Few Non-Essential Elements

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 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 non-essential 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: December 24, 1996 Revised: September 21, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Oxley, J., Wu, H. Matroids and Graphs with Few Non-Essential Elements. Graphs Comb 16, 199–229 (2000). https://doi.org/10.1007/PL00021178

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00021178

Keywords

Navigation