ExtremalC4-Free/C5-Free Planar Graphs
From MaRDI portal
Publication:2833118
DOI10.1002/jgt.21991zbMath1401.05079arXiv1512.04385OpenAlexW2107962892MaRDI QIDQ2833118
Publication date: 16 November 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.04385
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Exact rainbow numbers for matchings in plane triangulations ⋮ Planar Turán numbers of cycles: a counterexample ⋮ Generalized planar Turán numbers ⋮ Extremal \(H\)-free planar graphs ⋮ Planar Turán Number of the 6-Cycle ⋮ On the maximum number of edges in planar graphs of bounded degree and matching number ⋮ Extremal \(P_8\)-free/\(P_9\)-free planar graphs ⋮ Outerplanar Turán numbers of cycles and paths ⋮ LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS ⋮ Planar anti-Ramsey numbers of matchings ⋮ Planar Turán numbers of cubic graphs and disjoint union of cycles ⋮ Unnamed Item ⋮ Planar Turán number of the disjoint union of cycles ⋮ Inverting the Turán problem with chromatic number ⋮ On the Turán number of theta graphs ⋮ Planar anti-Ramsey numbers of paths and cycles ⋮ Planar Turán numbers on short cycles of consecutive lengths ⋮ Extremal Theta-free planar graphs ⋮ Planar Turán numbers of short paths ⋮ Inverse Turán numbers ⋮ Planar Turán number of intersecting triangles
Cites Work