Planar Turán number of the disjoint union of cycles

DOI10.1016/j.dam.2023.09.021MaRDI QIDQ6184334

No author found.

Publication date: 24 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

extremal graphslower boundplanar Turán numberdisjoint union of \(C_3\) and \(C_4\)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Planar Turán numbers on short cycles of consecutive lengths
• Planar Turán number of intersecting triangles
• Planar Turán numbers of cycles: a counterexample
• Planar Turán numbers of short paths
• Extremal \(H\)-free planar graphs
• Simple paths on polyhedra
• ExtremalC₄-Free/C₅-Free Planar Graphs
• Planar Turán Number of the 6-Cycle

This page was built for publication: Planar Turán number of the disjoint union of cycles