Counting bi-colored A'Campo forests [article]

Noémie Combe, Vincent Jugé
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