Interval chromatic number of an ordered graph: Difference between revisions

Content deleted Content added
m Difference with chromatic number: Fixing links to disambiguation pages, replaced: graph{{dn|date=January 2016}} →... using AWB
Fuck
Tags: references removed Mobile edit Mobile web edit
Line 1:
In
In mathematics, the '''interval [[chromatic number]]''' ''X''<sub><</sub>(''H'') of an [[ordered graph]] ''H'' is the minimum number of intervals the (linearly ordered) vertex set of ''H'' can be [[partition of a set|partitioned]] into so that no two vertices belonging to the same interval are adjacent in ''H''.<ref>[[János Pach]], Gabor Tardos, "Forbidden Pattern and Unit Distances",page 1-9,2005,ACM.</ref>
 
== Difference with chromatic number ==