Pages that link to "Item:Q5511877"
From MaRDI portal
The following pages link to A Solution of the Shannon Switching Game (Q5511877):
Displaying 50 items.
- Waiter-Client and Client-Waiter planarity, colorability and minor games (Q271623) (← links)
- Winning fast in fair biased maker-breaker games (Q322263) (← links)
- From clutters to matroids (Q405078) (← links)
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- Indicated coloring of matroids (Q477356) (← links)
- Client-waiter games on complete and random graphs (Q504971) (← links)
- Global maker-breaker games on sparse graphs (Q616371) (← links)
- The switching game on unions of oriented matroids (Q658004) (← links)
- Clutters and circuits (Q675907) (← links)
- Ideal clutters (Q697573) (← links)
- Structural theorems for submodular functions, polymatroids and polymatroid intersections (Q757383) (← links)
- On matroids with few circuits containing a pair of elements (Q764898) (← links)
- Matroids with a unique non-common circuit containing a fixed element (Q776269) (← links)
- Maker-Breaker domination game (Q776271) (← links)
- Random-player maker-breaker games (Q888617) (← links)
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants (Q1009166) (← links)
- The directed switching game on Lawrence oriented matroids (Q1041602) (← links)
- On chooser-picker positional games (Q1044991) (← 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)
- Matroidal games (Q1076623) (← links)
- Characterization of even directed graphs (Q1085177) (← links)
- A solution to the Box Game (Q1095050) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- A solution of the misère Shannon switching game (Q1110463) (← links)
- Characterizations of finitary and cofinitary binary matroids (Q1117941) (← links)
- Polyhedra of regular p-nary group problems (Q1121172) (← links)
- Functions computed by monotone Boolean formulas with no repeated variables (Q1121854) (← links)
- Infinite subgraphs as matroid circuits (Q1139051) (← links)
- Matroid representation over GF(3) (Q1144030) (← links)
- Theory of connexes. I (Q1160086) (← links)
- A simple approach to some basic results in matroid theory (Q1161524) (← links)
- Principal partition of graphs and connectivity games (Q1171517) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- Shannon switching games without terminals. III (Q1199126) (← links)
- Fractional arboricity, strength, and principal partitions in graphs and matroids (Q1208447) (← links)
- Geography (Q1210545) (← links)
- Edge-disjoint spanning trees and depth-first search (Q1217713) (← links)
- A composition for matroids (Q1219292) (← links)
- The principal minors of a matroid (Q1221769) (← links)
- Independent transversals for countable set systems (Q1223296) (← links)
- On maximally distant spanning trees of a graph (Q1229218) (← links)
- Chords and disjoint paths in matroids (Q1241753) (← links)
- Matroids, generalized networks, and electric network synthesis (Q1242107) (← links)
- Orientability of matroids (Q1245227) (← links)
- The matroids with the max-flow min-cut property (Q1245970) (← links)
- A note on the production of matroid minors (Q1249179) (← links)
- Theory of division games (Q1252163) (← links)
- A product of matroids and its automorphism group (Q1255013) (← links)
