A graph is 3-connected when it has at least four vertices and remains connected after deletion of any two vertices.

Ancestors (8)

  1. k-connected graph
  2. Vertex connectivity
  3. Menger theorem
  4. Graph theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8. Home

Incoming links (2)

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