Publication:4012032
From MaRDI portal
zbMath0769.05026MaRDI QIDQ4012032
James G. Oxley, Thomas H. Brylawski
Publication date: 27 September 1992
05B35: Combinatorial aspects of matroids and geometric lattices
Related Items
The lattice of integral flows and the lattice of integral cuts on a finite graph, Unnamed Item, Combinatorial Laplacians of matroid complexes, Nowhere zero 4‐flow in regular matroids, Active orders for matroid bases, The combinatorial Laplacian of the Tutte complex, Acyclic orientations and the chromatic polynomial, Hopf algebras and the Penrose polynomial, Algorithmic uses of the Feferman-Vaught theorem, Interval partitions and activities for the greedoid Tutte polynomial, Tutte polynomials computable in polynomial time, Characterizations of \(\text{PG}(n-1,q)\setminus\text{PG}(k-1,q)\) by numerical and polynomial invariants, On the topology of graph picture spaces, The number of nowhere-zero flows on graphs and signed graphs, Ordering events in Minkowski space, Enumerating degree sequences in digraphs and a cycle--cocycle reversing system, A MacWilliams type identity for matroids, On chromatic and flow polynomial unique graphs, On Tutte polynomial uniqueness of twisted wheels, A bijection for Eulerian-equivalence classes of totally cyclic orientations, Being Hamiltonian is not a Tutte invariant, The algebra of flows in graphs, A characterization of jointless Dowling geometries, The Tutte polynomial of a morphism of matroids. I: Set-pointed matroids and matroid perspectives, A convolution formula for the Tutte polynomial, Forests, colorings and acyclic orientations of the square lattice, The computational complexity of knot and matroid polynomials, On the number of 3-edge colorings of cubic graphs, Splitting formulas for Tutte polynomials, \(g\)-elements of matroid complexes., Unique representability and matroid reconstruction, A note on Tutte polynomials and Orlik--Solomon algebras, Lattice path matroids: Enumerative aspects and Tutte polynomials, Interlace polynomials, Tension-flow polynomials on graphs, The Go polynomials of a graph., T-uniqueness of some families of \(k\)-chordal matroids, Tutte polynomials of generalized parallel connections, Tutte polynomials and related asymptotic limiting functions for recursive families of graphs, The Tutte polynomial of a morphism of matroids. III: Vectorial matroids, Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids, Some results on generalised Whitney functions, Expected rank in antimatroids, Recursively constructible families of graphs, Complete principal truncations of Dowling lattices, An algorithm for the Tutte polynomials of graphs of bounded treewidth, Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems., A Möbius identity arising from modularity in a matroid bilinear form, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, Locally grid graphs: Classification and Tutte uniqueness, Series-parallel posets and the Tutte polynomial, Algebras related to matroids represented in characteristic zero, Exploring the Tutte-Martin connection, Irreducibility of the Tutte polynomial of a connected matroid, Polynomials associated with nowhere-zero flows, Graphs determined by polynomial invariants, Recurrence relations for the spectrum polynomial of a matroid, Enumerative applications of a decomposition for graphs and digraphs, Matroid inequalities, Characterizing combinatorial geometries by numerical invariants, The Tutte polynomial of a morphism of matroids. IV: Computational complexity, Coloring complexes and arrangements, Activity preserving bijections between spanning trees and orientations in graphs, Tutte uniqueness of line graphs, A new formula for an evaluation of the Tutte polynomial of a matroid, Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\), On matroids determined by their Tutte polynomials, The chip-firing game, Transition polynomials, A Tutte decomposition for matrices and bimatroids, A Greedoid Polynomial Which Distinguishes Rooted Arborescences
