Euler observed that the only relevant information here are the land masses (the nodes) and the connections between them (the bridges, or edges), which reduces the problem to a simple graph.

Consider a family of random ordered graph trees (T n ) n≥1 , where T n has n vertices. It has previously been established that if the associated search-depth processes converge to the normalised ...

Thomas E. Dilts, Peter J. Weisberg, Philip Leitner, Marjorie D. Matocq, Richard D. Inman, Kenneth E. Nussear, Todd C. Esque, Multiscale connectivity and graph theory ...