Pages that link to "Item:Q3608835"
From MaRDI portal
The following pages link to On the Number of Cycles in Planar Graphs (Q3608835):
Displayed 11 items.
- Counting carambolas (Q293619) (← links)
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- Monotone paths in geometric triangulations (Q726107) (← links)
- Triangle-free graphs with the maximum number of cycles (Q898130) (← links)
- Disjoint compatible geometric matchings (Q1942309) (← links)
- Bounding the number of cycles in a graph in terms of its degree sequence (Q2225410) (← links)
- Convex Polygons in Geometric Triangulations (Q3449827) (← links)
- Convex Polygons in Geometric Triangulations (Q5366966) (← links)
- On the maximum number of cycles in outerplanar and series-parallel graphs (Q5891226) (← links)
- On the maximum number of cycles in outerplanar and series-parallel graphs (Q5917852) (← links)
- An upper bound for the number of rectangulations of a planar point set (Q6117435) (← links)