Interval chromatic number of an ordered graph
id:
interval-chromatic-number-of-an-ordered-graph-202-8011671
title:
Interval chromatic number of an ordered graph
text:
In mathematics, the interval chromatic number X<(H) of an ordered graph H is the minimum number of intervals the (linearly ordered) vertex set of H can be partitioned into so that no two vertices belonging to the same interval are adjacent in H.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Interval_chromatic_number_of_an_ordered_graph
date created:
date modified:
2024-04-21T23:40:00Z
main entity:
{"identifier":"Q6057270","url":"https://www.wikidata.org/entity/Q6057270"}
image:
fields total:
13
integrity:
13