1-planar graphs with minimum degree at least 3 have bounded girth

01/15/2020
by   Francois Dross, et al.
0

We show that every 1-planar graph with minimum degree at least 4 has girth at most 8, and every 1-planar graph with minimum degree at least 3 has girth at most 198.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro