Interval chromatic number of an ordered graph: Difference between revisions

Content deleted Content added
Added short description
Tags: Mobile edit Mobile app edit Android app edit App description add
 
(2 intermediate revisions by 2 users not shown)
Line 1:
{{Short description|Concept in the mathematics field of graph theory}}
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>
{{one source |date=April 2024}}
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 ==