Equating $k$ Maximum Degrees in Graphs without Short Cycles

M. Fürst, M. Gentner, M. A. Henning +2

For an integer $k$ at least $2$, and a graph $G$, let $f_k(G)$ be the minimum cardinality of a set $X$ of vertices of $G$ such that $G-X$ has either $k$ vertices of maximum degree…