arXiv (All)
open access
The Game Chromatic Number of Complete Multipartite Graphs
In this paper we investigate the game chromatic number for complete multipartite graphs. Our results consist of two findings: (1) building on Dunn's strategies for equal-sized parts, we determine the closed-form formulas for the game chromatic number for all complete multipartite graphs without sing
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 Complete Multipartite Graphs with Singletons and Large Parts#1296515
- $(2,\mathcal{F})$-Avoiding Coloring and B-Coloring under Bipartite Exclusions#1144883
- Multiset Colorings of Random Graphs Across Density Regimes#1049104
- Bounds for B-coloring planar and outerplanar graphs#818487
- Counting Graph Homomorphisms in Bipartite Settings#1248281
Record · ID 1296325
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