An Algorithm to Find a K5 Minor
ILLINOIS UNIV AT URBANA COLL OF ENGINEERING
Pagination or Media Count:
We present an On squared algorithm that, given a graph, either returns a K sub 5 minor or reports that no such minor exists. The algorithm exploits a characterization of graphs containing no K sub 5 minor that is similar to Wagners characterization.
- Theoretical Mathematics