paper

Face covers and rooted minors in bounded genus graphs

arXiv:2503.09230

Abstract

A {\em rooted graph} is a graph together with a designated vertex subset, called the {\em roots}. In this paper, we consider rooted graphs embedded in a fixed surface. A collection of faces of the embedding is a {\em face cover} if every root is incident to some face in the collection. We prove that every -connected, rooted graph that has no rooted minor and is embedded in a surface of Euler genus , has a face cover whose size is upper-bounded by some function of and , provided that the face-width of the embedding is large enough in terms of . In the planar case, we prove an unconditional upper bound, improving a result of Böhme and Mohar~\cite{BM02}. The higher genus case was claimed without a proof by Böhme, Kawarabayashi, Maharry and Mohar~\cite{BKMM08}.

Face covers and rooted minors in bounded genus graphs · wovepaper