Peripheral cycle

From Wikipedia, the free encyclopedia

In graph theory, a peripheral cycle in a graph G is a cycle that is induced and non-separating. That is, it is a cycle C such that

  • no two vertices in C are connected by an edge not in C and
  • the graph G − C (we are deleting vertices of C and all incident edges) is connected.

[edit] Properties

In a 3-connected planar graph, boundaries of faces are precisely the peripheral cycles.

The cycle space of a 3-connected graph is generated by the peripheral cycles (a result of Tutte, 1963).

[edit] External links