A Combinatorial Model for Series-Parallel Networks
From MaRDI portal
Publication:5618392
DOI10.2307/1995423zbMath0215.33702MaRDI QIDQ5618392
Publication date: 1971
Full work available at URL: https://doi.org/10.2307/1995423
Related Items
On sign-representable matroids, Some Local Extremal Connectivity Results for Matroids, Some Small Circuit-Cocircuit Ramsey Numbers for Matroids, Distance Hereditary Graphs and the Interlace Polynomial, A Decomposition for Combinatorial Geometries, Connected hyperplanes in binary matroids, Combinatorial and algebraic structure in Orlik-Solomon algebras, The regular matroids with no 5-wheel minor, On the numbers of bases and circuits in simple binary matroids, On some extremal connectivity results for graphs and matroids, Reliable assignments of processors to tasks and factoring on matroids, Matroid shellability, \(\beta\)-systems, and affine hyperplane arrangements, Tutte polynomials computable in polynomial time, On the unimodality of the independent set numbers of a class of matroids, On the intersections of circuits and cocircuits in matroids, A geometric approach to forbidden minors for GF(3), On minor-minimally-connected matroids, A matroid invariant via the \(K\)-theory of the Grassmannian, Proof theory for linear lattices, A characterization of the ternary matroids with no \(M(K_ 4)\)-minor, Directed switching games on graphs and matroids, On ternary transversal matroids, A characterization of a class of non-binary matroids, On fixing elements in matroid minors, On a covering problem of Mullin and Stanton for binary matroids, Coherent orientations and series-parallel networks, Decomposition of regular matroids, A unique exchange property for bases, A constructive approach to the critical problem for matroids, Hyperplane reconstruction of the Tutte polynomial of a geometric lattice, Biased graphs. II: The three matroids, Ternary paving matroids, Solution of Rota's problem on the order of series-parallel networks, A composition for matroids, Connected matroids with the smallest Whitney numbers, Acyclic and totally cyclic orientations of combinatorial geometries, Some extremal connectivity results for matroids, Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs, Splitting formulas for Tutte polynomials, Note on inseparability graphs of matroids having exactly one class of orientations, T-uniqueness of some families of \(k\)-chordal matroids, Tutte polynomials of generalized parallel connections, On the structure of 3-connected matroids and graphs, On coefficients of the Tutte polynomial, Chromatic polynomials and order ideals of monomials, On packing minors into connected matroids, Parallel connections and coloured Tutte polynomials, The smallest rounded sets of binary matroids, On an excluded-minor class of matroids, Orlik-Solomon algebras and Tutte polynomials, The Tutte polynomial of a ported matroid, On circuit exchange properties for matroids, Acyclic modular lattices and their representations, Normal forms for binary relations, The Tutte-Grothendieck ring, Patroids, On matroids determined by their Tutte polynomials, On Crapo's Beta Invariant for Matroids, On Connectivity in Matroids and Graphs, An Affine Representation for Transversal Geometries, Modular Constructions for Combinatorial Geometries, The Broken-Circuit Complex
Cites Work
- Unnamed Item
- The coloring of graphs
- Topology of series-parallel networks
- The Tutte polynomial
- Möbius inversion in lattices
- A logical expansion in mathematics
- On the Abstract Properties of Linear Dependence
- The Möbius function of a lattice
- Lectures on matroids
- A higher invariant for matroids
- On the Foundations of Combinatorial Theory II. Combinatorial Geometries
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
