This allows for the definition of the anti-van derWaerden number of a graph, which is the least positive integer r such that every exact r-coloring of a graph contains a rainbow k-term arithmetic ...

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 ...

We present a framework for identifying subpopulations in mega-patches using a combination of spatial autocorrelation and graph theory analyses. We apply our approach to southern California giant kelp ...

In theory, it cannot be ruled out that the algorithms might run for longer than the age of the universe. But in practice, many algorithms seem to work just fine.