OurBigBook About$ Donate
 Sign in Sign up

Interval chromatic number of an ordered graph

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Computational mathematics Computational problems in graph theory Graph coloring
 0 By others on same topic  0 Discussions Create my own version
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.

 Ancestors (6)

  1. Graph coloring
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook