# Counting bi-colored A'Campo forests

## TL;DR

This paper introduces an efficient polynomial-time algorithm for counting bi-colored A'Campo forests and provides a stratification criterion for their graph space, addressing an open problem in the field.

## Contribution

It presents a novel polynomial-time counting algorithm and a stratification criterion for bi-colored A'Campo forests, advancing understanding of their combinatorial structure.

## Key findings

- Polynomial-time counting algorithm for bi-colored A'Campo forests
- Stratification criterion for the space of these graphs
- Resolution of an open question by A'Campo

## 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.