Even Length Loop and Connectivity in Graphs
We assume that the length of the longest loop is even, that is, n is even. Without loss of generality, we consider x2v2. Then x2 is connected to at least v4, v6, v8,..., vn, otherwise it will violate k1.
原文地址: https://www.cveoy.top/t/topic/m30g 著作权归作者所有。请勿转载和采集!