We prove that a graph does not contain as a minor a graph formed by 0-, 1-, 2- or 3-summing kk copies of K5K5 or K3,3K3,3, if and only if it has bounded genus.
生成讲解博客的中文版本
生成AI智能校验的中文版本