Bibliographic record
Abstract
The circular chromatic number provides a more refined measure of colourability of graphs, than does the ordinary chromatic number. Thus circular colouring is of substantial importance wherever graph colouring is studied or applied, for example, to scheduling problems of periodic nature. Precisely, the circular chromatic number of a graph G is the smallest ratio p/q of positive integers p and q for which there exists a mapping c:V(G)->{1,2,...,p} such that q<=|c(u)-c(v)|<=p-q for every edge uv of G. We present some known and new results regarding the computation of the circular chromatic number. In particular, we prove a lemma which can be used to improve the ratio of some circular colourings. These results are later used to bound the circular chromatic number of the plane unit-distance graph, the projective plane orthogonality graph, generalized Petersen graphs, and squares of graphs. Some of the computations in this thesis are computer assisted. Nesetril's "pentagon problem", asks whether the circular chromatic number of every cubic graph having sufficiently high girth is at most 5/2. We prove that the statement of the pentagon colouring problem is false with odd-girth in place of girth; and that if the pentagon colouring problem is true then the girth requirement is at least 10. Additionally, we present results of extensive computations of the circular chromatic numbers of small cubic graphs with girth at most 10. We also prove that every subcubic graph with girth at least 9 which can be embedded in either the plane, the projec tive plane, the torus, or the Klein bottle, has circular chromatic number strictly less than 3. Finally we investigate circular edge colourings of cubic graphs. In particular, we establish the circular chromatic index for several infinite families of snarks, namely Isaacs' flower snarks, Goldberg snarks, and generalized Blanusa snarks.
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.002 | 0.013 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.004 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.012 | 0.002 |
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".