Xiong, LiuDinneen, Michael2009-04-082009-04-082000-02Computer Science Technical Reports 171 (2000)1173-3500http://hdl.handle.net/2292/3505We present a general algorithm for checking whether one graph is a minor of another. Although this algorithm is not polynomial-time, it is quite practical for small graphs. For all connected graphs with 5 vertices or less we count how many connected graphs of order at most 9 are above them in the minor order. Our computed tables may be useful in the design of heuristic algorithms for minor closed families of graphs.https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htmTechnical ReportFields of Research::280000 Information, Computing and Communication SciencesThe author(s)