OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Petersen's theorem

 Home Mathematics Fields of mathematics Computational mathematics Computational problems in graph theory Matching (graph theory)
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Petersen's theorem refers to a specific result in graph theory related to the structure of graphs. It states that every cubic vertex-transitive graph that is not bipartite contains a Hamiltonian cycle. A graph is cubic if every vertex has degree 3 (i.e., each vertex is connected to exactly three other vertices).

 Ancestors (6)

  1. Matching (graph theory)
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook