Lehmans switching game and a theorem of Tutte and Nash-Williams
From MaRDI portal
Publication:5586414
DOI10.6028/jres.069B.005zbMath0192.09102MaRDI QIDQ5586414
Publication date: 1965
Published in: Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics (Search for Journal in Brave)
Related Items
Unnamed Item, Blocking and anti-blocking pairs of polyhedra, On a packing problem for infinite graphs and independence spaces, Van der Waerden and Ramsey type games, Cycle games and cycle cut games, Directed switching games on graphs and matroids, Generalized polymatroids and submodular flows, On the spanning tree polyhedron, Forests, frames, and games: Algorithms for matroid sums and applications, Fractional arboricity, strength, and principal partitions in graphs and matroids, Edge-disjoint spanning trees and depth-first search, The principal minors of a matroid, Compatible systems of representatives, Biased positional games on matroids, Shannon switching games without terminals. II, Equicovering matroids by distinct bases, Finding maximum square-free 2-matchings in bipartite graphs, On partitioning two matroids into common independent subsets, The intersection of a matroid and a simplicial complex, The maximum interval number of graphs with given genus, Generalized networks: Networks embedded on a matroid, part I, Generalized networks: Networks embedded on a matroid, part II, Transversal matroid intersections and related packings
