The planar Turán number of \(\{K_4, C_5\}\) and \(\{K_4, C_6\}\)

DOI10.1007/S00373-024-02830-4zbMATH Open1548.05173MaRDI QIDQ6616439

Ervin Győri, Runtian Zhou, Alan Li

Publication date: 9 October 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

cycleextremal planar graphplanar Turán number

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

• Title not available (Why is that?)
• Extremal Theta-free planar graphs
• On the structure of linear graphs
• Extremal \(C_{4}\)-free/\(C_{5}\)-free planar graphs
• Planar Turán Number of the 6-Cycle

This page was built for publication: The planar Turán number of \(\{K_4, C_5\}\) and \(\{K_4, C_6\}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616439)