Pages that link to "Item:Q2659227"
From MaRDI portal
The following pages link to The maximum number of paths of length four in a planar graph (Q2659227):
Displaying 12 items.
- Paths of length four (Q1874372) (← links)
- Generalized outerplanar Turán number of short paths (Q2092428) (← links)
- The maximum number of 10- and 12-cycles in a planar graph (Q2099482) (← links)
- Planar Turán numbers of short paths (Q2334068) (← links)
- Generalized planar Turán numbers (Q2665977) (← links)
- On the Number of 4-Edge Paths in Graphs With Given Edge Density (Q5366950) (← links)
- Subgraph densities in a surface (Q5886343) (← links)
- On the maximum number of edges in planar graphs of bounded degree and matching number (Q6041557) (← 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)
- Bounding the number of odd paths in planar graphs via convex optimization (Q6606323) (← links)
- On the rainbow planar Turán number of double stars (Q6611065) (← links)