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

A cycle is a polygon tree. A new polygon tree $G′$ can be created out of an existing polygon tree $G$ by adding a cycle which shares exactly one edge with graph $G$.

I want to know which graph class it belongs to.

share|cite|improve this question
There are many ways to describe graphs, so asking which "graph class" these graphs belong to is ambiguous, since it is included in many: the class of $2$-connected graphs that are not $3$-connected, for example, or the class of graphs that are at most $3$-colorable. – Andrew Salmon Aug 16 '13 at 0:05
Thanks Andrew, actually I want to know which standard graph classes it includes and/or a subset of – sgpl Aug 16 '13 at 4:09
It seems the following. By induction we can easily prove that all polygon trees are planar. When all added cycles are triangles, then we obtain exactly 2-trees with at least 3 vertices (see more about 2-trees, for instance, at p.10 of our paper). – Alex Ravsky Aug 17 '13 at 9:27

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.