Let G be a balanced bipartite graph of order 2n and minimum degree δ(G) ≥ 3. If, for every balanced independent set S of four vertices, |N(S)| > n then G is traceable, the circumference is at least 2n - 2 and G contains a 2-factor (with only small order exceptional graphs for the latter statement). If the neighborhood union condition is replaced by |N(S)| > n + 2 then G is hamiltonian.
展开▼
机译：令G为2n阶且最小度δ（G）≥3的平衡二部图。如果，对于四个顶点的每个平衡独立集S，| N（S）|。 > n，则G是可追踪的，圆周至少为2n-2，并且G包含2因子（对于后一种说法，只有小阶例外图）。如果邻域联合条件由| N（S）|代替> n + 2，则G为哈密顿量。
展开▼
