We consider that two orientations of a regular matroid are equivalent if one can be obtained from the other by successive reorientations of positive circuits and/or positive cocircuits. We study the inductive deletion-contraction structure of these equivalence classes in the set of orientations, and we enumerate these classes as evaluations of the Tutte polynomial. This generalizes the results in digraphs from a previous paper
We show that the 4-variable generating function of certain orientation related parameters of an orde...
Abstract. We develop a new framework for investigating linear equivalence of di-visors on graphs usi...
AbstractTwo elements of an oriented matroid constitute an invariant pair if all signed circuits cont...
We consider that two orientations of a regular matroid are equivalent if one can be obtained from th...
The first author introduced the circuit–cocircuit reversal system of an oriented matroid, and showed...
International audienceThe first author introduced the circuit–cocircuit reversal system of an orient...
AbstractWe give some new enumerations of indegree sequences of orientations of a graph using the Tut...
International audienceWe introduce the active partition of the ground set of an oriented matroid per...
AbstractLet M be a matroid on a finite set. Let M(M) denote the set of oriented matroids whose under...
We consider the cocircuit graph GM of an oriented matroid M, which is the 1-skeleton of the cell com...
We characterize the class of graphs in which the edges can be oriented in such a way that going alon...
AbstractA comparison of two expressions of the Tutte polynomial of an ordered oriented matroid, one ...
AbstractWe consider the cocircuit graph GMof an oriented matroid M, which is the 1-skeleton of the c...
AbstractWe characterize the class of graphs in which the edges can be oriented in such a way that go...
Dedicated to R. Stanley on the occasion of his 60th birthday (Stanley Festschrift)International audi...
We show that the 4-variable generating function of certain orientation related parameters of an orde...
Abstract. We develop a new framework for investigating linear equivalence of di-visors on graphs usi...
AbstractTwo elements of an oriented matroid constitute an invariant pair if all signed circuits cont...
We consider that two orientations of a regular matroid are equivalent if one can be obtained from th...
The first author introduced the circuit–cocircuit reversal system of an oriented matroid, and showed...
International audienceThe first author introduced the circuit–cocircuit reversal system of an orient...
AbstractWe give some new enumerations of indegree sequences of orientations of a graph using the Tut...
International audienceWe introduce the active partition of the ground set of an oriented matroid per...
AbstractLet M be a matroid on a finite set. Let M(M) denote the set of oriented matroids whose under...
We consider the cocircuit graph GM of an oriented matroid M, which is the 1-skeleton of the cell com...
We characterize the class of graphs in which the edges can be oriented in such a way that going alon...
AbstractA comparison of two expressions of the Tutte polynomial of an ordered oriented matroid, one ...
AbstractWe consider the cocircuit graph GMof an oriented matroid M, which is the 1-skeleton of the c...
AbstractWe characterize the class of graphs in which the edges can be oriented in such a way that go...
Dedicated to R. Stanley on the occasion of his 60th birthday (Stanley Festschrift)International audi...
We show that the 4-variable generating function of certain orientation related parameters of an orde...
Abstract. We develop a new framework for investigating linear equivalence of di-visors on graphs usi...
AbstractTwo elements of an oriented matroid constitute an invariant pair if all signed circuits cont...