In matroid theory, a binary matroid is a matroid that can be represented over the finite field GF(2). That is, up to isomorphism, they are theâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Leslie Ann Goldberg, Mark Jerrum
- J. Comput. Syst. Sci.
- 2013

We consider the problem of approximating certain combinatorial polynomials. First, we consider the problem of approximating theâ€¦Â (More)

Is this relevant?

2012

2012

- Xiangqian Zhou
- Discrete Mathematics
- 2012

We prove that if N is an internally 4-connected proper minor of a weakly 4-connected binary matroid M with |E(N)| â‰¥ 7, thenâ€¦Â (More)

Is this relevant?

2010

2010

- W. T. Tutte
- 2010

1. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following. Aâ€¦Â (More)

Is this relevant?

2004

2004

- Raul Cordovil, David Forge, Sulamita Klein
- Discrete Mathematics
- 2004

Let G be a finite simple graph. From the pioneering work of R. P. Stanley it is known that the cycle matroid of G isâ€¦Â (More)

Is this relevant?

1997

1997

- Luis A. Goddyn
- 1997

We show that if M is a connected binary matroid of cogirth at least ve which does not have both an F 7-minor and an F 7-minorâ€¦Â (More)

Is this relevant?

1994

1994

- Lisa Hellerstein, Collette R. Coullard
- SODA
- 1994

In this paper we present an algorithm that extends previous research in two distinct fields matroid theory and computationalâ€¦Â (More)

Is this relevant?

1987

1987

- James G. Oxley, Gina Oxley
- 1987

The cycle matroids of wheels are the fundamental building blocks for the class of binary matroids. Brylawski has shown that aâ€¦Â (More)

Is this relevant?

1987

1987

- Robert E. Bixby, William H. Cunningham
- Eur. J. Comb.
- 1987

Given a simple graph G having vertex set V, it is obvious that for any spanning tree T, there is an edge of Twhose fundamentalâ€¦Â (More)

Is this relevant?

1987

1987

- Francisco Barahona, Michele Conforti
- Discrete Mathematics
- 1987

A family of subsets of a ground set closed under the operation of taking symmetric differences is the family of cycles of aâ€¦Â (More)

Is this relevant?

1986

1986

- Paul D. Seymour
- Eur. J. Comb.
- 1986

Watkins and Mesner characterized edge-triples of a graph which are not in any circuit, and Chakravarti and Robertson solved theâ€¦Â (More)

Is this relevant?