arXiv (All)
open access
The Complexity of Undirected Partizan Edge Geography
Partizan Edge Geography is a two-player game on a graph where each player has their own token on a vertex and moves their token to a neighbor in a turn removing the edge. Two player alternately move their tokens and the first player who cannot move loses the game. Fraenkel and Simonson (TCS, 1993) s
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Applications of graph theory in Optimization and Network Analysis#74045
- Digitale Wirtschaft - Regionen im Benchmarkingvergleich : Ruhrgebiet - Madrid - Tokio - New York#217390
- AUGMANITAI / NEOMANITAI — Sport-Performance-Informed Methodology, Coupled-Performance Working Papers, and The Explicitation Protocol (Extended Restricted Snapshot v2, 2026-04-23)#124714
- No advantageous merging in minimum cost spanning tree problems#499786
- A Theory of Friendly Boards#10526
Record · ID 1012519
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive