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

page 1

page 2

page 3

page 4

research
10/03/2019

A note on 1-planar graphs with minimum degree 7

It is well-known that 1-planar graphs have minimum degree at most 7, and...
research
11/11/2019

Matchings in 1-planar graphs with large minimum degree

In 1979, Nishizeki and Baybars showed that every planar graph with minim...
research
08/13/2021

Subcubic planar graphs of girth 7 are class I

We prove that planar graphs of maximum degree 3 and of girth at least 7 ...
research
07/05/2020

Elimination distance to bounded degree on planar graphs

We study the graph parameter elimination distance to bounded degree, whi...
research
08/14/2019

Light edges in 1-planar graphs of minimum degree 3

A graph is 1-planar if it can be drawn in the plane so that each edge is...
research
10/06/2017

Decomposing 4-connected planar triangulations into two trees and one path

Refining a classical proof of Whitney, we show that any 4-connected plan...
research
06/22/2015

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

We consider a natural restriction of the List Colouring problem: k-Regul...

Please sign up or login with your details

Forgot password? Click here to reset