Pages that link to "Item:Q3586455"
From MaRDI portal
The following pages link to On the Number of Spanning Trees a Planar Graph Can Have (Q3586455):
Displaying 13 items.
- Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere (Q278890) (← links)
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- Counting carambolas (Q293619) (← links)
- Small grid embeddings of 3-polytopes (Q629826) (← links)
- A duality transform for constructing small grid embeddings of 3d polytopes (Q679743) (← links)
- Invulnerability of planar two-tree networks (Q1733045) (← links)
- On numbers of pseudo-triangulations (Q1947983) (← links)
- Embedding stacked polytopes on a polynomial-size grid (Q2358818) (← links)
- Skyscraper polytopes and realizations of plane triangulations (Q2407381) (← links)
- The number of spanning trees of plane graphs with reflective symmetry (Q2568971) (← links)
- Realizing Planar Graphs as Convex Polytopes (Q3223957) (← links)
- Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$ (Q5014139) (← links)
- Robust network formation with biological applications (Q6620422) (← links)
