Interval chromatic number of an ordered graph
From Wikipedia, the free encyclopedia
In mathematics, the interval chromatic number X<(H) of an ordered graph H is the minimum number of intervals the (linearly ordered) vertex set of H can be partitioned into so that no two vertices belonging to the same interval are adjacent in H.[1]
This article relies largely or entirely on a single source. (April 2024) |