scientific article; zbMATH DE number 3227800
From MaRDI portal
zbMath0141.21601MaRDI QIDQ5516084
Publication date: 1966
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of graph theory (05C90) Combinatorial aspects of matroids and geometric lattices (05B35) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)
Related Items
Multiterminal duality and three-terminal series-parallelness, The combinatorial Riemann mapping theorem, Even circuits in oriented matroids, The mathematical foundations of bond graphs. III: Matroid theory, Orientations of chain groups, Note on inseparability graphs of matroids having exactly one class of orientations, The incidence structure of subspaces with well-scaled frames, Generalizing the all-pairs min cut problem, The Tutte group of a weakly orientable matroid, Enumerating degree sequences in digraphs and a cycle--cocycle reversing system, Complementarity in Oriented Matroids, Algebraic flows in regular matroids, Tutte polynomials for regular oriented matroids, Orientations of golden-mean matroids, On the rank of general linear series on stable curves, Foundations of network theory, A “from scratch” proof of a theorem of Rockafellar and Fulkerson, Matroids and multicommodity flows, Decomposition of group flows in regular matroids, Optimal cocircuits in regular matroids and applications, An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem, A Decomposition for Combinatorial Geometries, Unnamed Item, Weak orientability of matroids and polynomial equations, A unified interpretation of several combinatorial dualities, Combinatorial reciprocity theorems, Five variations on a theme by Gyula Farkas, Greedy oriented flows, On circuit valuation of matroids, A combinatorial generalization of polytopes, Adjacency matrix concepts for the analysis of the interconnection of networks, A composition for matroids, Two algorithms for matroids, The Euler circuit theorem for binary matroids, Oriented matroids, A class of monotone operator functions related to electrical network theory, Chords and disjoint paths in matroids, Matroids, generalized networks, and electric network synthesis, Orientability of matroids, A combinatorial abstraction of linear programming, The matroids with the max-flow min-cut property, Bimatroids and invariants, Convex programming and systems of elementary monotonic relations, The Tutte polynomial, Characterizations of ternary matroids in terms of circuit signatures, On the unimodality of the independent set numbers of a class of matroids, The Tutte polynomial of a ported matroid, Graph theory and statistical physics, Graphes fortement connexes c-minimaux et graphes sans circuit co-minimaux, Matroid signatures coordinatizable over a semiring, Matroid algorithm for monitorability analysis of bond graphs, A characterization of the orientations of ternary matroids, Oriented matroids and multiply ordered sets, Activity preserving bijections between spanning trees and orientations in graphs, Bipolar orientations revisited, On basis-exchange properties for matroids, Recent trends in combinatorial optimization, Matroid packing and covering with circuits through an element, A new saling algorithm for the maximum mean cut problem, Oriented matroids from smooth manifolds
