scientific article; zbMATH DE number 3301261
From MaRDI portal
zbMath0188.55903MaRDI QIDQ5582910
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The principal partition of a pair of graphs and its applications, Equicovering matroids by distinct bases, Matroids and linking systems, Computing pure Nash and strong equilibria in bottleneck congestion games, A note on list arboricity, Axioms for infinite matroids, Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs, Count and cofactor matroids of highly connected graphs, Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees, Unnamed Item, The \(k\)-path tree matroid and its applications to survivable network design, Brick partitions of graphs, The Euler circuit theorem for binary matroids, On the reconstruction of locally finite trees, Graph reconstruction—a survey, On the structures induced by bipartite graphs and infinite matroids, An extension of Tutte's 1-factor theorem, Submodular functions and independence structures, Exchange systems, A matroid generalization of a theorem of Mendelsohn and Dulmage, The rank formula of Nash-Williams as a source of covering and packing theorems, Unions of oriented matroids, Semidirect sums of matroids
