Papers
Topics
Authors
Recent
2000 character limit reached

Face covers and rooted minors in bounded genus graphs (2503.09230v1)

Published 12 Mar 2025 in math.CO and cs.DM

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 $3$-connected, rooted graph that has no rooted $K_{2,t}$ minor and is embedded in a surface of Euler genus $g$, has a face cover whose size is upper-bounded by some function of $g$ and $t$, provided that the face-width of the embedding is large enough in terms of $g$. In the planar case, we prove an unconditional $O(t4)$ upper bound, improving a result of B\"ohme and Mohar~\cite{BM02}. The higher genus case was claimed without a proof by B\"ohme, Kawarabayashi, Maharry and Mohar~\cite{BKMM08}.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.