A note on 1-planar graphs with minimum degree 7

by   Therese Biedl, et al.
University of Waterloo

It is well-known that 1-planar graphs have minimum degree at most 7, and not hard to see that some 1-planar graphs have minimum degree exactly 7. In this note we show that any such 1-planar graph has at least 24 vertices, and this is tight.


page 1

page 2

page 3

page 4


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

We show that every 1-planar graph with minimum degree at least 4 has gir...

Degree-3 Planar Graphs as Topological Minors of Wall Graphs in Polynomial Time

In this note, we give a proof of the fact that we can efficiently find d...

4-cop-win graphs have at least 19 vertices

We show that the cop number of any graph on 18 or fewer vertices is at m...

A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings

A plus-contact representation of a planar graph G is called c-balanced i...

Enumeration of chordal planar graphs and maps

We determine the number of labelled chordal planar graphs with n vertice...

Confining the Robber on Cographs

In this paper, the notions of trapping and confining the robber on a gra...

Local Routing in Sparse and Lightweight Geometric Graphs

Online routing in a planar embedded graph is central to a number of fiel...

Please sign up or login with your details

Forgot password? Click here to reset