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

2020/01/15 by Dross, François
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics

paper · doi:10.48550/arxiv.2001.05402

Abstract

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.

Related

• A note on 1-planar graphs with minimum degree 7
• Subcubic planar graphs of girth 7 are class I
• Graphs with equal girth and circumference
• On the cop number of graphs of high girth
• Maximal Planar Subgraphs of Fixed Girth in Random Graphs