A new proof for a result of Kingan and Lemos' (Q5964999)
From MaRDI portal
scientific article; zbMATH DE number 6548097
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new proof for a result of Kingan and Lemos' |
scientific article; zbMATH DE number 6548097 |
Statements
A new proof for a result of Kingan and Lemos' (English)
0 references
2 March 2016
0 references
The prism graph is the dual of the complete graph on five vertices with an edge deleted, \(K_5\setminus e\). A decomposition theorem for the class of binary matroids with no prism minor was given in [\textit{S. R. Kingan} and \textit{M. Lemos}, Graphs Comb. 30, No. 6, 1479--1497 (2014; Zbl 1306.05027)]. The authors provide an alternate proof of these results.
0 references
binary matroid
0 references
3-connected binary matroid
0 references
internally 4-connected binary matroid
0 references
induced separation
0 references
prism minor
0 references
fundamental graph
0 references
blocking sequence
0 references
