Planar Turán numbers of cubic graphs and disjoint union of cycles
From MaRDI portal
Publication:6121913
DOI10.1007/s00373-024-02750-3arXiv2202.09216MaRDI QIDQ6121913
Zi-Xia Song, Yongxin Lan, Yongtang Shi
Publication date: 26 March 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.09216
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Unnamed Item
- Planar Turán number of intersecting triangles
- The Turán number of the triangular pyramid of 3-layers
- Planar Turán numbers of cycles: a counterexample
- Extremal Theta-free planar graphs
- Extremal \(H\)-free planar graphs
- ExtremalC4-Free/C5-Free Planar Graphs
- Rainbow Numbers for Cycles in Plane Triangulations
- Planar Turán Number of the 6-Cycle
- On the structure of linear graphs
This page was built for publication: Planar Turán numbers of cubic graphs and disjoint union of cycles