Every 4-connected graph with minimum degree δδ and connectivity κκ either has a cycle of length at least 4δ−2κ4δ−2κ or has a dominating cycle.
生成讲解博客的中文版本
生成AI智能校验的中文版本