arXiv (All)
open access
The game chromatic number of generalized Mycielski graphs of paths and cycles
The graph coloring game is a two-player game in which the players alternately color an uncolored vertex of a graph $G$. The game chromatic number is the minimum number of colors needed for the first player to guarantee a win. We investigate this parameter for generalized Mycielski graphs $M_k(G)$, w
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
- The game chromatic number of generalized Mycielski graphs of paths and cycles#919950
- Majority C-coloring in Cartesian products#780968
- Majority C-coloring in Cartesian products#779593
- Cayley Tournaments Simultaneously Critical for the Clique and Dichromatic Numbers#985991
- Maximum Matching-Match: Hardness and Approximation#975248
Record · ID 924181
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