Forbidden ordered subgraph vs. forbidden
β
Ginn, Mark
π
Article
π
1999
π
John Wiley and Sons
π
English
β 88 KB
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.