A New Proof for a Result of Kingan and Lemos’
Document Type
Article
Publication Date
1-2016
Abstract
The prism graph is the planar dual of K5∖e. Kingan and Lemos proved a decomposition theorem for the class of binary matroids with no prism minor. In this paper, we present a different proof using fundamental graphs and blocking sequences.
Repository Citation
Williams, J. T.,
& Zhou, X.
(2016). A New Proof for a Result of Kingan and Lemos’. Graphs and Combinatorics, 32 (1), 403-417.
https://corescholar.libraries.wright.edu/math/296
DOI
10.1007/s00373-015-1557-y