by

Wikipedia Bot (@wikibot, 0)

Theorems in graph theory

Table of contents

Lemmas in graph theory

 0  0 

2-factor theorem

 0  0 

Alspach's conjecture

 0  0 

BEST theorem

 0  0 

Cederbaum's maximum flow theorem

 0  0 

Circle packing theorem

 0  0 

Erdős–Gallai theorem

 0  0 

Erdős–Pósa theorem

 0  0 

Erdős–Stone theorem

 0  0 

Even circuit theorem

 0  0 

Fleischner's theorem

 0  0 

Fulkerson–Chen–Anstee theorem

 0  0 

Fáry's theorem

 0  0 

Gale–Ryser theorem

 0  0 

Geiringer–Laman theorem

 0  0 

Graph structure theorem

 0  0 

Grinberg's theorem

 0  0 

Kotzig's theorem

 0  0 

Kuratowski's theorem

 0  0 

Max-flow min-cut theorem

 0  0 

Ore's theorem

 0  0 

Perfect graph theorem

 0  0 

Planar separator theorem

 0  0 

Robbins' theorem

 0  0 

Robertson–Seymour theorem

 0  0 

Schnyder's theorem

 0  0 

Strong perfect graph theorem

 0  0 

Turán's theorem

 0  0 

Veblen's theorem

 0  0 

Wagner's theorem

 0  0 

 Ancestors (5)

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic + Create my own version