Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I'm having problems finding the right words to formulate the following class of graphs in a definition. I'm defining a class of plane graphs with the following properties:

  • Removing any vertex of the outer face will not make the graph disconnected
  • Removing any two vertices not in the outer face will not make the graph disconnected.

The best definition I could find for now is to say $G$ is 2-connected on the outer face and 3-connected everywhere else.

share|cite|improve this question
Can you give some counter examples? – draks ... Oct 9 '12 at 13:19

Your Answer


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

Browse other questions tagged or ask your own question.