Bibliographic record
Abstract
In the graph colouring game introduced by Bodlaender [7], two players, Alice and Bob, alternately colour uncoloured vertices of a given graph $G$ with one of $k$ colours so that adjacent vertices receive different colours. Alice wins if every vertex is coloured at the end. The game chromatic number of $G$ is the smallest $k$ such that Alice has a winning strategy. In Bodlaender's original game, Alice begins. We also consider variants of this game where Bob begins or skipping turns is allowed [1] and their generalizations to digraphs [2]. By means of forbidden induced subgraphs (resp.\ forbidden induced subdigraphs), for several pairs $(g_1,g_2)$ of such graph (resp.\ digraph) colouring games $g_1$ and~$g_2$, which define game chromatic numbers $\chi_{g_1}$ and~$\chi_{g_2}$, we characterise the classes of graphs (resp.\ digraphs) such that, for any induced subgraph (resp.\ subdigraph)~$H$, the game chromatic numbers $\chi_{g_1}(H)$ and $\chi_{g_2}(H)$ of~$H$ are equal.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.002 | 0.003 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.007 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".