Revision as of 04:40, 28 May 2008 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits usual Wikipedia conventions ← Previous edit		Revision as of 08:22, 23 October 2008 edit undo Mhym (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 9,949 edits m János Pach Next edit →
Line 1: 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>~~Janos~~[[János Pach]], Gabor Tardos, "Forbidden Pattern and Unit Distances",page 1-9,2005,ACM.</ref> == Difference with chromatic number ==

Interval chromatic number of an ordered graph: Difference between revisions