A connected graph is unicyclic when it contains exactly one cycle, equivalently when its numbers of vertices and edges agree.

Ancestors (7)

  1. Subcritical component bound for a binomial random graph
  2. Probabilistic combinatorics
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7. Home

Incoming links (1)

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