Abstract
We show that every 1-planar graph with minimum degree at least 4 has girth at most , and every 1-planar graph with minimum degree at least 3 has girth at most .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.