8 citations · 12 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2021
A graph coloring approach to family-based haplotype reconstruction
Jason A. Anema, Laura Escobar
Edge Constrained Vertex Coloring (ECVC) problems are defined on a finite multigraph, their solutions are characterized, and a linear time algorithm is given for solving ECVCs o…
math.CO2016★ 8 cited
Counting spanning trees on fractal graphs and their asymptotic complexity
Jason A. Anema, Konstantinos Tsougkas
Using the method of spectral decimation and a modified version of Kirchhoff's Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to…
math.CO2012★ 4 cited
Counting Spanning Trees on Fractal Graphs
Jason A. Anema
Using the method of spectral decimation and a modified version of Kirchhoffs Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to…