On the Number of Spanning Trees a Planar Graph Can Have
From MaRDI portal
Publication:3586455
DOI10.1007/978-3-642-15775-2_10zbMath1287.05062arXiv0912.0712OpenAlexW2132345770MaRDI QIDQ3586455
Publication date: 6 September 2010
Published in: Algorithms – ESA 2010 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0912.0712
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (10)
Embedding stacked polytopes on a polynomial-size grid ⋮ Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere ⋮ Configurations of non-crossing rays and related problems ⋮ Counting carambolas ⋮ Skyscraper polytopes and realizations of plane triangulations ⋮ Realizing Planar Graphs as Convex Polytopes ⋮ Small grid embeddings of 3-polytopes ⋮ On numbers of pseudo-triangulations ⋮ Invulnerability of planar two-tree networks ⋮ A duality transform for constructing small grid embeddings of 3d polytopes
This page was built for publication: On the Number of Spanning Trees a Planar Graph Can Have