An extension of elementary bipartite graphs to matroid pairs and its characterization

An extension of elementary bipartite graphs to matroid pairs and its characterization

0.00 Avg rating0 Votes
Article ID: iaor1995677
Country: Netherlands
Volume: 48
Issue: 3
Start Page Number: 285
End Page Number: 288
Publication Date: Feb 1994
Journal: Discrete Applied Mathematics
Authors:
Keywords: matroids
Abstract:

This paper presents a generalization of elementary bipartite graphs to a certain pair of matroids, which it calls an ‘elementary pair’, and shows that a matroid pair is elementary if and only if it is irreducible with respect to a decomposition method associated with matroid intersection problems.

Reviews

Required fields are marked *. Your email address will not be published.