search

oscarlevin / discrete-book

An open textbook for Discrete Mathematics, as taught at the University of Northern Colorado
http://discrete.openmathbooks.org/dmoi3.html
Other
212 stars 67 forks source link

4.3 Planar Graphs - possible trivial case #131

Open SerDigby opened 1 year ago

SerDigby commented 1 year ago

Hi, sorry another trivial case I thought perhaps worth checking.

We end up using gf ≤ 2e to assess whether or not any given graph is planar, with g being the girth. Acyclic graphs are considered to have infinite girth. It seems a graph like a tree or a single vertex would be considered planar but not satisfy the proof?

Thanks, Enjoying the book!