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:
“It amazes me when I hear any person prefer blindness to deafness. Such a person must have a terrible dread of being alone. Blindness makes one totally dependent on others, and deprives us of every satisfaction that results from light.”
—Horace Walpole (1717–1797)
““The ideal reasoner,” he remarked, “would, when he had once been shown a single fact in all its bearings, deduce from it not only all the chain of events which led up to it but also all the results which would follow from it.””
—Sir Arthur Conan Doyle (1859–1930)