A generalization of Tutte's characterization of totally unimodular matrices

DOI10.1006/jctb.1997.1751zbMath0885.05041OpenAlexW2071547261MaRDI QIDQ1369653

James F. Geelen

Publication date: 20 April 1998

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/af91f3d6f51a2a1cf62160e967d34761bf27ac14

zbMATH Keywords

matroidminors

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (10)

Maximal pivots on graphs with an application to gene assembly ⋮ The adjacency matroid of a graph ⋮ Interlace polynomials for multimatroids and delta-matroids ⋮ From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals ⋮ Graph reductions, binary rank, and pivots in gene assembly ⋮ Nullity invariance for pivot and the interlace polynomial ⋮ The group structure of pivot and loop complementation on graphs and set systems ⋮ Binary matroids and local complementation ⋮ Pivots, determinants, and perfect matchings of graphs ⋮ Isotropic matroids. I: Multimatroids and neighborhoods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of unimodular orientations of simple graphs
• Unimodularity and circle graphs
• A short proof of Tutte's characterization of totally unimodular matrices
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
• Principally unimodular skew-symmetric matrices
• Greedy algorithm and symmetric matroids
• Lectures on matroids

This page was built for publication: A generalization of Tutte's characterization of totally unimodular matrices