Prove that every connected planar graph with less than 12 vertices has a vertex of degree at most 4. [Hint: Assume that every vertex has degree at least 5 to obtain a lower bound on e (together with the upper bound on e in the corollary) that implies

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter3: Matrices
Section3.7: Applications
Problem 74EQ
icon
Related questions
Question

Prove that every connected planar graph with less than 12 vertices has a vertex of degree at most 4. [Hint: Assume that every vertex has degree at least 5 to obtain a lower bound on e (together with the upper bound on e in the corollary) that implies v ≥ 12.]

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning