A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
It is shown that the discharging method can be successfully applied on infinite planar graphs of subexponential growth and even on those graphs that do not satisfy the strong edge isoperimetric inequality. The general outline of the method is presented and the following applications are given: Planar graphs with only finitely many vertices of degree ≤ 5 and with subexponential growth contain arbitrarily large finite submaps of the tessellation of the plane or of some tessellation of thedoi:10.1090/s0002-9947-02-03004-0 fatcat:2biuwenhj5fbbhlbpv4ap5l4gm