scientific article; zbMATH DE number 3365295
From MaRDI portal
Publication:5638342
zbMATH Open0231.05027MaRDI QIDQ5638342FDOQ5638342
Authors: William T. Tutte 
Publication date: 1971
Title of this publication is not available (Why is that?)
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)
Cited In (51)
- Hypergraph Horn functions
- Recognizing a class of bicircular matroids
- Divisors on graphs, binomial and monomial ideals, and cellular resolutions
- On functions of strength t
- On matroidal families
- On the efficiency of representability tests for matroids
- A short proof of Tutte's characterization of totally unimodular matrices
- Lattices, graphs, and Conway mutation
- The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids
- Unavoidable Induced Subgraphs of Large 2-Connected Graphs
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices
- Matroids and antimatroids - a survey
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Representations of matroids and free resolutions for multigraded modules
- Polyhedra of regular p-nary group problems
- Matroid union -- graphic? binary? neither?
- Bridges and Hamiltonian circuits in planar graphs
- Subgraphs as circuits and bases of matroids
- On Four Problems in Graph Theory
- The graphicity of the union of graphic matroids
- A Tiled Order of Finite Global Dimension with No Neat Primitive Idempotent
- The circuit basis in binary matroids
- Oriented matroids
- Covering finite fields with cosets of subspaces
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
- Uncovering generalized-network structure in matrices
- Matroids with many common bases.
- Discrete extremal problems
- On a definition of connected sets of a matroid
- Matroid intersection algorithms
- Patroids
- Decomposition of group flows in regular matroids
- A polynomial invariant and duality for triangulations
- Closure systems and their structure
- Nowhere-zero integral flows on a bidirected graph
- Die Jaboci-Abbildung über dem Raum der Mumfordkurven
- Graphic matroids and the multicommodity transportation problem
- A polynomial time algorithm for solving the closest vector problem in zonotopal lattices
- On subgraphs as matroid cells
- On matroids on edge sets of graphs with connected subgraphs as circuits. II
- Complexity and algorithms for computing Voronoi cells of lattices
- Matroids, generalized networks, and electric network synthesis
- On matroid connectivity
- A note on the critical problem for matroids
- Complement total unimodularity
- A Property Equivalent to Exchange Property in Matroids
- Dirac's theorem on simplicial matroids
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices
- Partition coefficients of acyclic graphs
- Separation of vertices by a circuit
- A circuit set characterization of antimatroids
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5638342)
