In this paper, we characterize the sets $\mathcal{H}$ of connected graphs such that there exists a constant $c=c(\mathcal{H})$ satisfying $γ(G)\leq c$ for every connected $\mathcal{H}$-free graph $G$, where $γ(G)$ is the domination number of $G$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。