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.

Type

Journal article

Intellectual base

Primary research

Year

1967

DOI

10.1093/comjnl/10.1.85

Link

https://doi.org/10.1093/comjnl/10.1.85

Cited from

mathematics

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.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:b713e3a9eeed · see in the full table