10 citations · 10 across the 2 of their papers we have counts for
2 papers
math.CO2025
Prüfer codes on vertex-colored rooted trees
R. W. R. Darling, Grant Fickes
Prüfer codes provide an encoding scheme for representing a vertex-labeled tree on vertices with a string of length . Indeed, two labeled trees are isomorphic if and only i…
math.PR2003★ 10 cited
Continuous and discontinuous phase transitions in hypergraph processes
R. W. R. Darling, D. A. Levin, J. R. Norris
Let V denote a set of N vertices. To construct a "hypergraph process", create a new hyperedge at each event time of a Poisson process; the cardinality K of this hyperedge is random…