A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Counting bi-colored A'Campo forests
[article]
2017
arXiv
pre-print
We give an efficient method of counting bi-colored A'Campo forests and provide a stratification criterion for the space of those graphs. We deduce an algorithm to count these forests in polynomial time, answering an open question of A'Campo.
arXiv:1702.07672v1
fatcat:7b4wjlmspzahzn4toemzwvd7ki