Directed switching games on graphs and matroids

DOI10.1016/0095-8956(86)90083-3zbMath0589.90109OpenAlexW2073029194WikidataQ56212885 ScholiaQ56212885MaRDI QIDQ1074519

Yahya Ould Hamidoune, Michel Las Vergnas

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(86)90083-3

zbMATH Keywords

matroidsgame on graphdirected Shannon switching gamepath generation game

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20) Positional games (pursuit and evasion, etc.) (91A24)

Related Items

Directed switching games. II: The arborescence game ⋮ A solution of the misère Shannon switching game ⋮ The switching game on unions of oriented matroids ⋮ Shannon switching games without terminals. III ⋮ Biased positional games on matroids ⋮ Connected Covering Numbers ⋮ Reconstruction of the orientation class of an oriented matroid ⋮ Game edge-connectivity of graphs ⋮ How many circuits determine an oriented matroid? ⋮ Yahya Ould Hamidoune's mathematical journey: a critical review of his work ⋮ The directed switching game on Lawrence oriented matroids ⋮ Connected coverings and an application to oriented matroids

Cites Work

• Cycle games and cycle cut games
• Convexity in oriented matroids
• The principal minors of a matroid
• Orientability of matroids
• Biased Positional Games
• A Solution of the Shannon Switching Game
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• A Combinatorial Model for Series-Parallel Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item