A New Proof for a Result of Kingan and Lemos'

作者：Williams Jesse T; Zhou Xiangqian^*

来源：Graphs and Combinatorics, 2016, 32(1): 403-417.

DOI：10.1007/s00373-015-1557-y

• Binary matroid
• 3-Connected
• Internally 4-connected
• Induced separation
• Prism minor
• Fundamental graph
• Blocking sequence

The prism graph is the planar dual of . Kingan and Lemos (Graphs Comb 30:1479-1497, 2014) 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.

• 出版日期2016-1