Article
A New Proof for a Result of Kingan and Lemos’
Graphs and Combinatorics
Document Type
Article
Publication Date
1-1-2016
Disciplines
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.
DOI
10.1007/s00373-015-1557-y
Citation Information
Jesse T. Williams and Xiangqian Zhou. "A New Proof for a Result of Kingan and Lemos’" Graphs and Combinatorics Vol. 32 Iss. 1 (2016) p. 403 - 417 ISSN: 09110119 Available at: http://works.bepress.com/xiangqian_zhou/2/