The following pages link to (Q5638342):
Displaying 50 items.
- Divisors on graphs, binomial and monomial ideals, and cellular resolutions (Q284775) (← links)
- Matroid union -- graphic? binary? neither? (Q298959) (← links)
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs (Q449209) (← links)
- The graphicity of the union of graphic matroids (Q491733) (← links)
- Dirac's theorem on simplicial matroids (Q659777) (← links)
- A polynomial invariant and duality for triangulations (Q743656) (← links)
- Matroids and antimatroids - a survey (Q757382) (← links)
- On functions of strength t (Q786818) (← links)
- A note on the critical problem for matroids (Q794658) (← links)
- Representations of matroids and free resolutions for multigraded modules (Q854097) (← links)
- Nowhere-zero integral flows on a bidirected graph (Q1053716) (← links)
- A circuit set characterization of antimatroids (Q1112050) (← links)
- Polyhedra of regular p-nary group problems (Q1121172) (← links)
- A short proof of Tutte's characterization of totally unimodular matrices (Q1122583) (← links)
- The circuit basis in binary matroids (Q1138561) (← links)
- Complement total unimodularity (Q1143465) (← links)
- Discrete extremal problems (Q1152306) (← links)
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids (Q1160629) (← links)
- Decomposition of group flows in regular matroids (Q1163563) (← links)
- Die Jaboci-Abbildung über dem Raum der Mumfordkurven (Q1171106) (← links)
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices (Q1204474) (← links)
- On matroids on edge sets of graphs with connected subgraphs as circuits. II (Q1217718) (← links)
- Subgraphs as circuits and bases of matroids (Q1217719) (← links)
- Separation of vertices by a circuit (Q1218436) (← links)
- On a definition of connected sets of a matroid (Q1223305) (← links)
- Oriented matroids (Q1225060) (← links)
- Covering finite fields with cosets of subspaces (Q1236571) (← links)
- Bridges and Hamiltonian circuits in planar graphs (Q1237746) (← links)
- Matroids, generalized networks, and electric network synthesis (Q1242107) (← links)
- On matroidal families (Q1258755) (← links)
- Uncovering generalized-network structure in matrices (Q1308737) (← links)
- Matroids with many common bases. (Q1406555) (← links)
- Closure systems and their structure (Q1602560) (← links)
- On the efficiency of representability tests for matroids (Q1835922) (← links)
- Lattices, graphs, and Conway mutation (Q1955773) (← links)
- Recognizing a class of bicircular matroids (Q2367405) (← links)
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices (Q2427899) (← links)
- On subgraphs as matroid cells (Q2548961) (← links)
- Patroids (Q2562865) (← links)
- Complexity and algorithms for computing Voronoi cells of lattices (Q3055167) (← links)
- A Tiled Order of Finite Global Dimension with No Neat Primitive Idempotent (Q3619574) (← links)
- A Property Equivalent to Exchange Property in Matroids (Q3976930) (← links)
- Matroid intersection algorithms (Q4077061) (← links)
- Graphic matroids and the multicommodity transportation problem (Q4154388) (← links)
- On Four Problems in Graph Theory (Q4722099) (← links)
- The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids (Q5101897) (← links)
- A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices (Q5163506) (← links)
- On matroid connectivity (Q5904771) (← links)
- Unavoidable Induced Subgraphs of Large 2-Connected Graphs (Q6098457) (← links)
- Hypergraph Horn functions (Q6499011) (← links)
