The following pages link to (Q3220597):
Displaying 23 items.
- The Las Vergnas polynomial for embedded graphs (Q491745) (← links)
- The active bijection for graphs (Q670651) (← links)
- Partial graph orientations and the Tutte polynomial (Q679543) (← links)
- Acyclic reorientations of weakly oriented matroids (Q810030) (← links)
- Enumerating degree sequences in digraphs and a cycle--cocycle reversing system (Q875070) (← links)
- The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: the fully optimal basis of a bounded region (Q1041606) (← links)
- Acyclic and totally cyclic orientations of combinatorial geometries (Q1256481) (← links)
- The Tutte polynomial of a morphism of matroids. I: Set-pointed matroids and matroid perspectives (Q1296154) (← links)
- The Tutte polynomial of a morphism of matroids. III: Vectorial matroids (Q1433001) (← links)
- Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids (Q1433002) (← links)
- On the number of circuit-cocircuit reversal classes of an oriented matroid (Q1727778) (← links)
- \(K\)-theoretic Tutte polynomials of morphisms of matroids (Q2019616) (← links)
- FPT algorithms to enumerate and count acyclic and totally cyclic orientations (Q2132402) (← links)
- On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids (Q2138951) (← links)
- Logarithmic concavity for morphisms of matroids (Q2173708) (← links)
- Topological bijections for oriented matroids (Q2306498) (← links)
- Fourientation activities and the Tutte polynomial (Q2408966) (← links)
- Fourientations and the Tutte polynomial (Q2408990) (← links)
- The Tutte polynomial of a morphism of matroids. V: Derivatives as generating functions of Tutte activities (Q2509723) (← links)
- Activity preserving bijections between spanning trees and orientations in graphs (Q2566282) (← links)
- Extremal graphs for the Tutte polynomial (Q2664552) (← links)
- A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements (Q2851480) (← links)
- Computing the fully optimal spanning tree of an ordered bipolar directed graph (Q6204322) (← links)
