@. References and . Vergnas, A correspondence between spanning trees and orientations in graphs Graph Theory and Combinatorics, pp.233-238, 1984.

@. References and . Vergnas, A correspondence between spanning trees and orientations in graphs Graph Theory and Combinatorics, Correspondance naturelle entre bases et réorientations des matro¨?desmatro¨?des orientés, pp.233-238, 1984.

@. References and . Vergnas, A correspondence between spanning trees and orientations in graphs Graph Theory and Combinatorics, Correspondance naturelle entre bases et réorientations des matro¨?desmatro¨?des orientés, pp.233-238, 1984.

@. V. Bases and ). V. , Activity preserving bijections between spanning trees and orientations in graphs The active bijection between regions and simplices in supersolvable arrangements of hyperplanes Fully optimal bases and the active bijection in graphs, hyperplane arrangements, and oriented matroids A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements References ? Las Vergnas. A correspondence between spanning trees and orientations in graphs Graph Theory and Combinatorics, EuroComb'07 (Sevilla) Correspondance naturelle entre bases et réorientations des matro¨?desmatro¨?des orientés. Ph.D. Université Bordeaux 1, pp.212-238, 1984.

@. V. Bases and @. V. , Activity preserving bijections between spanning trees and orientations in graphs The active bijection between regions and simplices in supersolvable arrangements of hyperplanes. Electronic Fully optimal bases and the active bijection in graphs, hyperplane arrangements, and oriented matroids A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane ArrangementsV. The active bijection in graphs, hyperplane arrangements, and oriented matroids -1 -The fully optimal basis of a bounded region, ) References ? Las Vergnas. A correspondence between spanning trees and orientations in graphs Graph Theory and Combinatorics ? G. Correspondance naturelle entre bases et réorientations des matro¨?desmatro¨?des orientés. Ph.D. Université Bordeaux 1, pp.212-238, 1984.

@. V. Bases and @. V. @bullet-g.-l, Activity preserving bijections between spanning trees and orientations in graphs The active bijection between regions and simplices in supersolvable arrangements of hyperplanes. Electronic ? G.-L.V. Fully optimal bases and the active bijection in graphs, hyperplane arrangements, and oriented matroids A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements The active bijection in graphs, hyperplane arrangements, and oriented matroids -1 -The fully optimal basis of a bounded region, The active bijection in graphs: overview, new results, complements and Tutte polynomial expressions. (almost) ready for submission and available on demand or at Arxiv, pp.212-238, 2004.

@. References and . Vergnas, A correspondence between spanning trees and orientations in graphs Graph Theory and Combinatorics, Correspondance naturelle entre bases et réorientations des matro¨?desmatro¨?des orientés, pp.233-238, 1984.

@. V. Bases and @. V. @bullet-g.-l, Activity preserving bijections between spanning trees and orientations in graphs The active bijection between regions and simplices in supersolvable arrangements of hyperplanes. Electronic ? G.-L.V. Fully optimal bases and the active bijection in graphs, hyperplane arrangements, and oriented matroids A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements The active bijection in graphs, hyperplane arrangements, and oriented matroids -1 -The fully optimal basis of a bounded region, The active bijection in graphs: overview, new results, complements and Tutte polynomial expressions. (almost) ready for submission and available on demand or at Arxiv, pp.212-238, 2004.

@. @bullet and @. V. , The active bijection in graphs, hyperplane arrangements, and oriented matroids. 2. Decomposition of activities. / 3. Linear programming construction of fully optimal bases. / 4. Deletion/contraction constructions and universality

@. References and . Vergnas, A correspondence between spanning trees and orientations in graphs Graph Theory and Combinatorics, Correspondance naturelle entre bases et réorientations des matro¨?desmatro¨?des orientés, pp.233-238, 1984.

@. V. Bases and @. V. @bullet-g.-l, Activity preserving bijections between spanning trees and orientations in graphs The active bijection between regions and simplices in supersolvable arrangements of hyperplanes. Electronic ? G.-L.V. Fully optimal bases and the active bijection in graphs, hyperplane arrangements, and oriented matroids A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements The active bijection in graphs, hyperplane arrangements, and oriented matroids -1 -The fully optimal basis of a bounded region, The active bijection in graphs: overview, new results, complements and Tutte polynomial expressions. (almost) ready for submission and available on demand or at Arxiv, pp.212-238, 2004.

@. @bullet and @. V. , The active bijection in graphs, hyperplane arrangements, and oriented matroids. 2. Decomposition of activities. / 3. Linear programming construction of fully optimal bases. / 4. Deletion/contraction constructions and universality, p.61