arXiv (All)
open access
Hull Games of Induced Path Convexities in Graphs
In 1984, Frank Harary introduced the first convexity games in graphs, all of them based on the geodesic convexity, which is the graph convexity related to shortest paths. In 2024, Araújo et al. obtained the first PSPACE-hardness proofs on some of these geodesic games and generalized them to any grap
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
- За игрой в карты с чертиком Визинга#71568
- Optimizing the CGMS upper bound on Ramsey numbers#793389
- Optimizing the CGMS upper bound on Ramsey numbers#789385
- Ehrhart positivity for lattice path matroids#926041
- Projected Gradient Method on Hadamard Manifolds#819979
Record · ID 1104501
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