Let G be a maximal planar graph.(adsbygoogle = window.adsbygoogle || []).push({});

I am having difficulty showing two properties:

(i) Show that a maximal planar graph is connected.

For this one I am fairly sure how the proof should go, I just can't seem to arrive at the desired result. If I showed the conclusion fails, then I can add an edge, obtaining a planar graph. Perhaps there is an easier way.

(ii) Show that a maximal planar graph is no bridges.

Again, the same way as (i), I just can't seem to get anywhere.

there were a few other properties that I was able to prove, but for some reason these are giving me some trouble. Any help is greatly appreciated

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Graph theory problem

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

Loading...

Similar Threads - Graph theory problem | Date |
---|---|

I Use of irrational numbers for coordinate system | Sep 12, 2017 |

I Spectral Bisection of Simplest Graph Clearly Incorrect | Aug 18, 2017 |

I The complete graph K_n can be expressed as the union of k bipartite graphs iff n≤2^k | Jun 26, 2017 |

I The largest n such that K_n can be expressed as the union of | Apr 26, 2017 |

Interesting graph theory problem | Oct 21, 2013 |

**Physics Forums - The Fusion of Science and Community**