On the Computational Complexity of Ordered Subgraph RecognitionDwight Duffus, Mark Ginn, Vojtech RÃ¶dlRandom Struct. Algorithms1995Let (G, <) be a finite graph G with a linearly ordered vertex set V. We consider the decision problem (G, <)ORD to have as an instance an (unordered) graph r and as a question whether there exists aâ€¦ (More)

Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classesMark GinnJournal of Graph Theory1999We show that the minimum set of unordered graphs that must be forbidden to get the same graph class characterized by forbidding a single ordered graph is infinite. c Â© 1999 John Wiley & Sons, Inc. Jâ€¦ (More)