arXiv (All)
open access
Undirected edge geography games on stacked prism graphs
The undirected edge geography is a two-player combinatorial game on an undirected graph. The players start at the root vertex and alternately move the root along an incident edge to its other endpoint and then delete that edge. The first player who has no remaining move is the loser. For positive in
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
- An Exact Counterexample to Affine-Like Price-of-Anarchy Shape in Quartic BPR Routing#1062080
- On the exact quantum chromatic number of generalized Johnson graphs#927944
- Trinqet: Private Triangle and Quadrangle Counting over Distributed Graphs#1084663
- Decentralized Optimization over Time-Varying Row-Stochastic Digraphs#1142601
- Combinatorial and graph-theoretic properties of the (1,1)-octagonal tilings#332321
Record · ID 998940
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