论文信息 - Random Triangulations of the Plane

Random Triangulations of the Plane

It is shown that random 2- and 3-connected triangulations (bicubic maps) with 2n faces (vertices) almost certainly contain cn, c>0, copies of any particular 2- or 3-connected triangulation (bicubic map), respectively. Almost all 2- and 3-connected triangulations, and bicubic maps, with m vertices have longest path length less than cm, for some c

Nicholas C. Wormald | L. Bruce Richmond | N. Wormald | L. Richmond

[1] W. T. Tutte. The Enumerative Theory of Planar Maps , 1973 .

[2] E. Bender. Asymptotic Methods in Enumeration , 1974 .

[3] W. T. Tutte,et al. A Census of Planar Triangulations , 1962, Canadian Journal of Mathematics.

[4] H. Robbins. A Remark on Stirling’s Formula , 1955 .

[5] T. A. Brown. Simple paths on convex polyhedra , 1961 .

[6] Nicholas C. Wormald. Enumeration of cyclically 4-connected cubic graphs , 1985, J. Graph Theory.

[7] W. T. Tutte. On the enumeration of convex polyhedra , 1980, J. Comb. Theory, Ser. B.

[8] W. T. Tutte. On Hamiltonian Circuits , 1946 .

[9] W. T. Tutte. A Census of Planar Maps , 1963, Canadian Journal of Mathematics.

[10] W. T. Tutte. A THEOREM ON PLANAR GRAPHS , 1956 .

[11] H. Whitney. A Theorem on Graphs , 1931 .

[12] Nicholas C. Wormald,et al. On Hamilton Cycles in 3-Connected Cubic Maps , 1985 .