Kuratowski's Theorem A graph is planar if and only if it does not contain a subdivision of either the complete graph K5 or of the bipartite graph K3,3 as a subgraph.
Kuratowski's Theorem
K5
K3,3
数学辞典收录了4151条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。