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.