Counting bi-colored A'Campo forests
From MaRDI portal
Publication:6283589
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.
This page was built for publication: Counting bi-colored A'Campo forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6283589)
