The following pages link to (Q3680852):
Displaying 13 items.
- Generalized outerplanar Turán number of short paths (Q2092428) (← links)
- The maximum number of 10- and 12-cycles in a planar graph (Q2099482) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- The maximum number of paths of length four in a planar graph (Q2659227) (← links)
- Generalized planar Turán numbers (Q2665977) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- The Planar Slope Number of Subcubic Graphs (Q5405034) (← links)
- Subgraph densities in a surface (Q5886343) (← links)
- The maximum number of paths of length three in a planar graph (Q6057639) (← links)
- Counting paths, cycles, and blow‐ups in planar graphs (Q6057641) (← links)
- The maximum number of induced C5's in a planar graph (Q6057646) (← links)
- Bounding the number of odd paths in planar graphs via convex optimization (Q6606323) (← links)
- The maximum number of pentagons in a planar graph (Q6657591) (← links)