Revision as of 12:33, 21 March 2008 edit Bipulkumarbal (talk \| contribs) 22 edits It's a new article		Revision as of 12:33, 21 March 2008 edit undo Bipulkumarbal (talk \| contribs) 22 edits No edit summary Next edit →
Line 9: Let K(H) is the chromatic number of any ordered graph H. Then for any ordered graph H, X<sub><</sub>(H) ≥ K(H). == Reference ==

Interval chromatic number of an ordered graph: Difference between revisions