The random division of faces in a planar graph
Keyword(s):
Consider a connected planar graph. A bounded face is said to be of type k, or is called a k-face, if the boundary of that face contains k edges. Under various natural rules for randomly dividing bounded faces by the addition of new edges, we investigate the limiting distribution of face type as the number of divisions increases.
Keyword(s):
1996 ◽
Vol 28
(02)
◽
pp. 377-383
◽
Keyword(s):
2009 ◽
Vol 25
(4)
◽
pp. 649-656
◽
1972 ◽
Vol 13
(2)
◽
pp. 116-121
◽
2014 ◽
Vol 24
(1)
◽
pp. 145-178
◽
Keyword(s):