An Upper Bound for the Chromatic Number of a Graph and Its Application to Timetabling Problems.¶
Welsh, D. J. A. (1967). An Upper Bound for the Chromatic Number of a Graph and Its Application to Timetabling Problems. The Computer Journal, 10(1), 85-86.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Disjointness
- In scheduling and resource allocation, non-overlapping time slots and conflict-free bookings are disjointness constraints, and scheduling-as-graph-coloring rests on them.
This sourceFormalizes scheduling/timetabling as graph coloring, where non-overlapping (disjoint) time slots correspond to color classes and conflicts to edges.
- In scheduling and resource allocation, non-overlapping time slots and conflict-free bookings are disjointness constraints, and scheduling-as-graph-coloring rests on them.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:b713e3a9eeed · see in the full table