Definitions from Wiktionary (Menger's theorem)

▸ noun:  (graph theory) A characterization of the connectivity in finite undirected graphs in terms of the minimum number of disjoint paths that can be found between any pair of vertices.


▸ Words similar to menger's theorem
▸ Usage examples for menger's theorem

▸ Idioms related to menger's theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near menger's theorem
▸ Rhymes of menger's theorem

▸ Invented words related to menger's theorem