Bicubic maps are in bijection with (0 ; 1)-trees. We introduce two new ways of decomposing (0 ; 1)-trees. Using this we de ne an endofunc- tion on (0 ; 1)-trees, and thus also on bicubic maps. We show that ...

A transversal matroid MM can be represented by a collection of sets, called a presentation of MM, whose partial transversals are the independent sets of MM. Minimal presentations are those for which removing any element ...

This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain ...

A matroid is T-unique if it is determined up to isomorphism by its Tutte polynomial. Known T-unique matroids include projective and affine geometries of rank at least four, wheels, whirls, free and binary spikes, and certain ...