Elsevier

Discrete Mathematics

Volume 313, Issue 5, 6 March 2013, Pages 677-688
Discrete Mathematics

Crossing 3-separations in 3-connected matroids☆

https://doi.org/10.1016/j.disc.2012.12.010Get rights and content
Under an Elsevier user license
open archive

Abstract

Flowers are useful structures in matroid theory to describe crossing 3-separations. And an important subclass with several extra properties is the class of maximal flowers. In this paper, we characterize which flowers of a 3-connected matroid can be displayed by a maximal flower.

Keywords

Matroids
Flowers
Separations

Cited by (0)

☆

The research supported partially by CNNSF (No. 11201076), SRFDP (No. 20113514120010) and JA11032.

Copyright © 2012 Elsevier B.V. All rights reserved.