|
|||||
|
|
Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes |
|
| Authors: | Mark Ginn |
| Abstract: | We 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. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 71–76, 1999 |
| Keywords: | forbidden subgraph forbidden ordered subgraph graph characterizations |