Pages that link to "Item:Q5586414"
From MaRDI portal
The following pages link to Lehmans switching game and a theorem of Tutte and Nash-Williams (Q5586414):
Displayed 44 items.
- Cyclic orderings and cyclic arboricity of matroids (Q414636) (← links)
- A short proof of the tree-packing theorem (Q418872) (← links)
- Spanning cycles in regular matroids without small cocircuits (Q449202) (← links)
- Indicated coloring of matroids (Q477356) (← links)
- Some inequalities for the Tutte polynomial (Q627930) (← links)
- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid (Q714036) (← links)
- On a packing problem for infinite graphs and independence spaces (Q754225) (← links)
- Coloring by two-way independent sets (Q1044959) (← links)
- Van der Waerden and Ramsey type games (Q1054728) (← links)
- Cycle games and cycle cut games (Q1055431) (← links)
- Directed switching games on graphs and matroids (Q1074519) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- On the spanning tree polyhedron (Q1122482) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- Fractional arboricity, strength, and principal partitions in graphs and matroids (Q1208447) (← links)
- Edge-disjoint spanning trees and depth-first search (Q1217713) (← links)
- The principal minors of a matroid (Q1221769) (← links)
- Compatible systems of representatives (Q1336656) (← links)
- Extensions of matroid covering and packing (Q1633609) (← links)
- An elementary, illustrative proof of the Rado-Horn theorem (Q1758456) (← links)
- Biased positional games on matroids (Q1765611) (← links)
- Shannon switching games without terminals. II (Q1812789) (← links)
- Equicovering matroids by distinct bases (Q1891366) (← links)
- Topological games at Princeton, a mathematical memoir (Q2389292) (← links)
- Finding maximum square-free 2-matchings in bipartite graphs (Q2498740) (← links)
- On partitioning two matroids into common independent subsets (Q2570121) (← links)
- A note on some inequalities for the Tutte polynomial of a matroid (Q2851528) (← links)
- Theory of Principal Partitions Revisited (Q2971607) (← links)
- Graphic Submodular Function Minimization: A Graphic Approach and Applications (Q2971617) (← links)
- Disjoint bases in a polymatroid (Q3055784) (← links)
- The intersection of a matroid and a simplicial complex (Q3420348) (← links)
- The maximum interval number of graphs with given genus (Q3797204) (← links)
- Generalized networks: Networks embedded on a matroid, part I (Q4088732) (← links)
- Generalized networks: Networks embedded on a matroid, part II (Q4110934) (← links)
- Transversal matroid intersections and related packings (Q4126086) (← links)
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering (Q4568066) (← links)
- A sharp edge bound on the interval number of a graph (Q4700529) (← links)
- Coverings and delta-coverings (Q5101418) (← links)
- An iterative algorithm to find maximum spanning sets and minimum linearly independent sets which partition a finite generator (Q5210723) (← links)
- Blocking and anti-blocking pairs of polyhedra (Q5668263) (← links)
- Fully dynamic arboricity maintenance (Q5918831) (← links)
- On Packing Dijoins in Digraphs and Weighted Digraphs (Q6057808) (← links)
- Supereulerian regular matroids without small cocircuits (Q6093141) (← links)
- Diverse collections in matroids and graphs (Q6201861) (← links)