Let G be a simple planar graph with no triangles. (a) Show that G has a...

90.2K

Verified Solution

Question

Advance Math

Let G be a simple planar graph with no triangles.

(a) Show that G has a vertex of degree at most 3. (The proof wassketched in the lectures, but you must write all the details, andyou may not just quote the result.)

(b) Use this to prove, by induction on the number of vertices,that G is 4-colourable.

Answer & Explanation Solved by verified expert
4.0 Ratings (697 Votes)
    See Answer
Get Answers to Unlimited Questions

Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!

Membership Benefits:
  • Unlimited Question Access with detailed Answers
  • Zin AI - 3 Million Words
  • 10 Dall-E 3 Images
  • 20 Plot Generations
  • Conversation with Dialogue Memory
  • No Ads, Ever!
  • Access to Our Best AI Platform: Flex AI - Your personal assistant for all your inquiries!
Become a Member

Other questions asked by students