Other Results
Ehrlich, Even & Tarjan (1976) showed computing the chromatic number of string graphs to be NP-hard. Kratochvil (1991) found that string graphs form an induced minor closed class, but not a minor closed class of graphs.
Read more about this topic: String Graph
Famous quotes containing the word results:
“Consider what you have in the smallest chosen library. A company of the wisest and wittiest men that could be picked out of all civil countries in a thousand years have set in best order the results of their learning and wisdom. The men themselves were hid and inaccessible, solitary, impatient of interruption, fenced by etiquette; but the thought which they did not uncover in their bosom friend is here written out in transparent words to us, the strangers of another age.”
—Ralph Waldo Emerson (1803–1882)