Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In three-connected graph $G = \langle V, E\rangle$, any three vertices $a,b,c \in V$ are contained in some simple cycle $C$ in $G$.

Please give some clues!

Thanks anyway!

share|cite|improve this question
up vote 1 down vote accepted

The key to the proof is exploiting the fact that the graph is $3$-connected. This means that for any two vertices $x,y$ there are three disjoint paths between $x$ and $y$, i.e. three paths that pairwise share no vertices.

Given your three vertices $a$, $b$ and $c$, you should be able to use this to construct a cycle. A good start might be to sketch a little diagram, and see how the $3$ sets of paths (between $a$ & $b$, $b$ & $c$ and $c$ & $a$) can intersect, and how you might construct a cycle from these.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.