<html><head><meta name="color-scheme" content="light dark"></head><body><pre style="word-wrap: break-word; white-space: pre-wrap;">\magnification=1200
\hsize=4in
\overfullrule=0pt
\nopagenumbers
\noindent
%
%
{\bf Thomas B\"ohme and Bojan Mohar}
%
%
\medskip
\noindent
%
%
{\bf Domination, Packing and Excluded Minors}
%
%
\vskip 5mm
\noindent
%
%
%
%
Let $\gamma(G)$ be the domination number of a graph $G$, and let
$\alpha_k(G)$ be the maximum number of vertices in $G$, no two of
which are at distance $\le k$ in $G$. It is easy to see that
$\gamma(G)\ge \alpha_2(G)$.  In this note it is proved that
$\gamma(G)$ is bounded from above by a linear function in
$\alpha_2(G)$ if $G$ has no large complete bipartite graph
minors. Extensions to other parameters $\alpha_k(G)$ are also derived.

\bye
</pre></body></html>