Two large cliques joined by a bipartite cross graph with edge count and vertex-cover number realize edge connectivity and vertex connectivity while preserving a chosen minimum degree.

Ancestors (7)

  1. Whitney inequalities for graph connectivity
  2. Menger theorem
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7. Home

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