A Combinatorial Model for Series-Parallel Networks
From MaRDI portal
Publication:5618392
DOI10.2307/1995423zbMath0215.33702OpenAlexW4252073190MaRDI QIDQ5618392
Publication date: 1971
Full work available at URL: https://doi.org/10.2307/1995423
Related Items
The Broken-Circuit Complex, Parallel edges in ribbon graphs and interpolating behavior of partial-duality polynomials, The binary matroids whose only odd circuits are triangles, A tight relation between series-parallel graphs and bipartite distance hereditary graphs, On ternary transversal matroids, On sign-representable matroids, Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry, 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, Some Local Extremal Connectivity Results for Matroids, A characterization of a class of non-binary matroids, On some extremal connectivity results for graphs and matroids, On fixing elements in matroid minors, Some Small Circuit-Cocircuit Ramsey Numbers for Matroids, Outerplanar obstructions for matroid pathwidth, On a covering problem of Mullin and Stanton for binary matroids, Coherent orientations and series-parallel networks, Decomposition of regular matroids, The geometry of geometries: matroid theory, old and new, Partitioning into common independent sets via relaxing strongly base orderability, A matroid analogue of a theorem of Brooks for graphs, Detecting minors in matroids through triangles, On Connectivity in Matroids and Graphs, A unique exchange property for bases, Singularities in Negami's splitting formula for the Tutte polynomial, Hepp's bound for Feynman graphs and matroids, On the Gorensteinness of broken circuit complexes and Orlik-Terao ideals, The Tutte polynomial of some matroids, A constructive approach to the critical problem for matroids, Hyperplane reconstruction of the Tutte polynomial of a geometric lattice, An Affine Representation for Transversal Geometries, Biased graphs. II: The three matroids, T-uniqueness of some families of \(k\)-chordal matroids, Tutte polynomials of generalized parallel connections, The Homfly and dichromatic polynomials, Ternary paving matroids, A Decomposition for Combinatorial Geometries, Broken circuit complexes of series-parallel networks, Bounding the beta invariant of 3-connected matroids, Solution of Rota's problem on the order of series-parallel networks, The category of matroids, Theta rank, levelness, and matroid minors, Reliable assignments of processors to tasks and factoring on matroids, Matroid shellability, \(\beta\)-systems, and affine hyperplane arrangements, Tutte polynomials computable in polynomial time, Connected hyperplanes in binary matroids, Unnamed Item, Unnamed Item, Distance Hereditary Graphs and the Interlace Polynomial, A composition for matroids, Parallel connections and coloured Tutte polynomials, Combinatorial and algebraic structure in Orlik-Solomon algebras, A recipe theorem for the topological Tutte polynomial of Bollobás and Riordan, The regular matroids with no 5-wheel minor, Acyclic modular lattices and their representations, Normal forms for binary relations, Relative Tutte Polynomials for Coloured Graphs and Virtual Knot Theory, On the numbers of bases and circuits in simple binary matroids, Connected matroids with the smallest Whitney numbers, The closure of a linear space in a product of lines, Kazhdan-Lusztig polynomials of matroids under deletion, Acyclic and totally cyclic orientations of combinatorial geometries, Some extremal connectivity results for matroids, Modular Constructions for Combinatorial Geometries, A matroid invariant via the \(K\)-theory of the Grassmannian, The smallest rounded sets of binary matroids, On an excluded-minor class of matroids, Orlik-Solomon algebras and Tutte polynomials, On the unimodality of the independent set numbers of a class of matroids, The Tutte polynomial of a ported matroid, On the intersections of circuits and cocircuits in matroids, On circuit exchange properties for matroids, The Tutte-Grothendieck ring, Patroids, 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, A geometric approach to forbidden minors for GF(3), On matroids determined by their Tutte polynomials, On minor-minimally-connected matroids, On Crapo's Beta Invariant for Matroids, Proof theory for linear lattices, A characterization of the ternary matroids with no \(M(K_ 4)\)-minor, Directed switching games on graphs and matroids
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