most citedReconstructing Rooted Trees From Their Strict Order Quasisymmetric Functions

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

math.CO2020★ 1 cited

Reconstructing Rooted Trees From Their Strict Order Quasisymmetric Functions

Jeremy Zhou

Determining whether two graphs are isomorphic is an important and difficult problem in graph theory. One way to make progress towards this problem is by finding and studying graph…