Longest and shortest cycles in random planar graphs
Work
Year: 2021
Type: article
Abstract: Let be a graph chosen uniformly at random from the class of all planar graphs on vertex set with edges. We study the cycle and block structure of when . More precisely, we determine the asymptotic or... more
Source: Random Structures and Algorithms
Authors Mihyun Kang, Michael Missethan
Institution Graz University of Technology
Cites: 38
Cited by: 1
Related to: 10
FWCI: 0.309
Citation percentile (by year/subfield): 32.84
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $4,330