scientific article
From MaRDI portal
Publication:3220597
zbMath0556.05013MaRDI QIDQ3220597
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
FPT algorithms to enumerate and count acyclic and totally cyclic orientations, On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids, Enumerating degree sequences in digraphs and a cycle--cocycle reversing system, Logarithmic concavity for morphisms of matroids, Extremal graphs for the Tutte polynomial, Fourientation activities and the Tutte polynomial, Fourientations and the Tutte polynomial, Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids, Computing the fully optimal spanning tree of an ordered bipolar directed graph, On the number of circuit-cocircuit reversal classes of an oriented matroid, The Tutte polynomial of a morphism of matroids. III: Vectorial matroids, Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids, The Las Vergnas polynomial for embedded graphs, The active bijection for graphs, Partial graph orientations and the Tutte polynomial, \(K\)-theoretic Tutte polynomials of morphisms of matroids, The Tutte polynomial of a morphism of matroids. V: Derivatives as generating functions of Tutte activities, Unnamed Item, Acyclic and totally cyclic orientations of combinatorial geometries, Topological bijections for oriented matroids, The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: the fully optimal basis of a bounded region, Activity preserving bijections between spanning trees and orientations in graphs, The Tutte polynomial of a morphism of matroids. I: Set-pointed matroids and matroid perspectives, A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements, Acyclic reorientations of weakly oriented matroids
