Interval chromatic number of an ordered graph
= Interval chromatic number of an ordered graph
{wiki=Interval_chromatic_number_of_an_ordered_graph}
The **interval chromatic number** of an ordered graph, often denoted as \\( \\chi_\{\\text\{I\}\}(G) \\), is a graph invariant that represents the minimum number of intervals on the real line needed to represent the vertices of the graph in such a way that there is an edge between two vertices if and only if their corresponding intervals intersect.