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.

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

What's the best way of proving this?

Let G be a simple planar graph with girth > 3

 1. Prove that G has a vertex of degree at most 3.
 2. Prove that G is 4-colorable
share|cite|improve this question
Welcome to Math SX. Please provide your thoughts on the problem. – Chris K Apr 3 '14 at 0:27

$1.$ Assume that $\delta(G)\geq4$. Then $2m\geq 4n$, where $m$ and $n$ denote the size and order of $G$. So $2n\leq m$ and since $G$ contains no triangles we know that $m\leq 2n-4$ which implies that $2n\leq 2n-4$ and so $0\leq -4$ which is a contradiction. Thus $G$ has a vertex of degree at most $3$.

I'm still working on $2.$

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.