An induced cycle is a cycle in a graph whose vertices induce exactly its cycle edges, with no edge between nonconsecutive vertices. A triangle is an induced cycle of length three. A chordal graph forbids induced cycles of length at least four.

Ancestors (7)

  1. Cycle in a graph
  2. Path in a graph
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7. Home

Incoming links (3)

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