A note on 1-planar graphs with minimum degree 7
Combinatorics
2019-10-07 v1 Discrete Mathematics
Abstract
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.
Keywords
Cite
@article{arxiv.1910.01683,
title = {A note on 1-planar graphs with minimum degree 7},
author = {Therese Biedl},
journal= {arXiv preprint arXiv:1910.01683},
year = {2019}
}
Comments
4 pages