| W.T. Tutte. A theory of 3-connected graphs. Proc. Koninklijke Nederlandse Akademie van Wetenschappen, Ser. A 64 (1961) 441--455. 8 |
....W 2 and W 3 . We would like to be able to extend our results further, at least to the enumeration of all 3 connected planar subgraphs. We have been unable to achieve such a result. However Corollary 5 is promising, as wheels figure prominently in Tutte s characterization of triconnected graphs [7]. 6 Conclusions We have described a number of circumstances in which some subgraph occurs O(n) times in the graphs of a minor closed family. We have also described algorithms that, in a more limited class of situations, can e#ciently enumerate the occurrences of a given subgraph. A number of ....
W.T. Tutte. A theory of 3-connected graphs. Proc. Koninklijke Nederlandse Akademie van Wetenschappen, Ser. A 64 (1961) 441--455. 8
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC