OurBigBook.comSite Source code

Dirac circumference theorem

A

k

-connected graph has a cycle of length at least

min {∣ G ∣, 2 k}

.

Table of contents 43 1
- Longest-cycle attachment argument Dirac circumference theorem 30

 Ancestors (7)