Mikhail Makarov

collaborators

3 papers

math.CO2026

A counterexample to the Albertson-Berman conjecture about induced forests in planar graphs

Mikhail Makarov

For a graph $G$ , denote by $a (G)$ the number of vertices in the largest induced forest in $G$ . The Albertson-Berman conjecture, which had been open since 1979, states that $a(G) \g…

math.CO2026

Large induced forests in planar multigraphs

Mikhail Makarov

For a graph $G$ , denote by $a (G)$ the number of vertices in the largest induced forest in $G$ . The Albertson-Berman conjecture, which has been open since 1979, states that $a(G) \g…

math.CO2026

Branching $k$ -path vertex cover of forests

Mikhail Makarov

We define a set $P$ to be a branching $k$ -path vertex cover of an undirected forest $F$ if all leaves and isolated vertices (vertices of degree at most $1$ ) of $F$ belong to $P$ an…

A counterexample to the Albertson-Berman conjecture about induced forests in planar graphs

Large induced forests in planar multigraphs

Branching k-path vertex cover of forests

Branching $k$ -path vertex cover of forests