arXiv · 1702.07672
Counting bi-colored A'Campo forests
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.
Explore related subjects
Keep this discovery
Noémie Combe, Vincent Jugé. 2017-02-24. Counting bi-colored A'Campo forests. https://arxiv.org/abs/1702.07672
Cite the original work for its findings. Save a collection to share your selection of sources.