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
Compatible systems of representatives, Extensions of matroid covering and packing, Equicovering matroids by distinct bases, Topological games at Princeton, a mathematical memoir, Generalized polymatroids and submodular flows, Spanning Rigid Subgraph Packing and Sparse Subgraph Covering, On the spanning tree polyhedron, Coverings and delta-coverings, On Packing Dijoins in Digraphs and Weighted Digraphs, Supereulerian regular matroids without small cocircuits, Cyclic orderings and cyclic arboricity of matroids, A short proof of the tree-packing theorem, Some inequalities for the Tutte polynomial, A sharp edge bound on the interval number of a graph, Diverse collections in matroids and graphs, Blocking and anti-blocking pairs of polyhedra, Theory of Principal Partitions Revisited, Graphic Submodular Function Minimization: A Graphic Approach and Applications, Spanning cycles in regular matroids without small cocircuits, The maximum interval number of graphs with given genus, Indicated coloring of matroids, Generalized networks: Networks embedded on a matroid, part I, Forests, frames, and games: Algorithms for matroid sums and applications, Generalized networks: Networks embedded on a matroid, part II, An elementary, illustrative proof of the Rado-Horn theorem, Fractional arboricity, strength, and principal partitions in graphs and matroids, Transversal matroid intersections and related packings, Biased positional games on matroids, Edge-disjoint spanning trees and depth-first search, The principal minors of a matroid, Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid, Finding maximum square-free 2-matchings in bipartite graphs, Disjoint bases in a polymatroid, An iterative algorithm to find maximum spanning sets and minimum linearly independent sets which partition a finite generator, Fully dynamic arboricity maintenance, Shannon switching games without terminals. II, On a packing problem for infinite graphs and independence spaces, Coloring by two-way independent sets, The intersection of a matroid and a simplicial complex, On partitioning two matroids into common independent subsets, A note on some inequalities for the Tutte polynomial of a matroid, Van der Waerden and Ramsey type games, Cycle games and cycle cut games, Directed switching games on graphs and matroids
