Abstract
The planar Turán number of a graph , denoted , is the maximum number of edges in a planar graph on vertices without containing as a subgraph. This notion was introduced by Dowden in 2016 and has attracted quite some attention since then; those work mainly focus on finding when is a cycle or Theta graph or has maximum degree at least four. In this paper, we study when is a cubic graph or disjoint union of cycles or .
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.