Degeneracy of outerplanar graphs

Observe that every outerplanar graph can be made into a maximal outerplanar graph of the same order. The regions in the interior of a maximal outer planar graph form a tree since if there was a cycle, that would surround a vertex, contradicting outerplanarity. Trees have at least two leaves. Any region corresponding to a leaf will have a vertex of degree 2. This vertex must have had degree less than or equal to 2 in the original graph.

Tags:

Graph Theory

Related

Context-sensitive grammar for the copy language Prove that every number ending in a $3$ has a multiple which consists only of ones. Generating correlated random numbers: Why does Cholesky decomposition work? Little Rudin series convergence exercise If the series $\sum_0^\infty a_n$ converges, then so does $\sum_1^\infty \frac{\sqrt{a_n}}{n} $ Given number of trailing zeros in n!, find out the possible values of n. Polynomials and partitions Finding sum of factors of a number using prime factorization On a two dimensional grid is there a formula I can use to spiral coordinates in an outward pattern? A system of equations with 5 variables: $a+b+c+d+e=0$, $a^3+b^3+c^3+d^3+e^3=0$, $a^5+b^5+c^5+d^5+e^5=10$ How to determine if 2 points are on opposite sides of a line What Topology does a Straight Line in the Plane Inherit as a Subspace of $\mathbb{R_l} \times \mathbb{R}$ and of $\mathbb{R_l} \times \mathbb{R_l}$

Recent Posts