Highly Influential

A graph is g{universal if it satisses two conditions. First it must contain a subdivision of every proper planar graph of degree at most three as a subgraph. Second, the function g puts a restriction on the subdivision. In particular, for a planar graph H of degree at most three, a xed vertex w 0 of H , and an arbitrary vertex w of H , the images of the… (More)

Sorry, we couldn't extract any figures or tables for this paper.