Counting bi-colored A'Campo forests
arXiv:1702.07672
Abstract
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.