Geometric and combinatorial structures on graphs
From MaRDI portal
alpha orientationsasymptotic enumerationbalanced stacked polytopesbipolar orientationsblossom graphBrightwell-Trotter theoremdiamond necklacesexponential upper boundsface countinglinear stacked polytopesorthogonal surfacesplanar mapsplanar orientationspolynomial upper boundsSchnyder woodssmall integer realizationsspanning treesspanning trees with many leavesstacked polytopesweighted faces
Recommendations
Cited in
(16)- On the number of planar orientations with prescribed degrees
- On the combinatorics of the graph-complex.
- Lattice structures from planar graphs
- Realizing planar graphs as convex polytopes
- On the Number of α-Orientations
- scientific article; zbMATH DE number 5704222 (Why is no real title available?)
- scientific article; zbMATH DE number 5722482 (Why is no real title available?)
- Schnyder Woods and Orthogonal Surfaces
- scientific article; zbMATH DE number 4101229 (Why is no real title available?)
- Improved bounds for spanning trees with many leaves
- scientific article; zbMATH DE number 1342089 (Why is no real title available?)
- Geometry of graph varieties
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
- scientific article; zbMATH DE number 5238759 (Why is no real title available?)
- Small grid embeddings of 3-polytopes
- Structural parameters of Schnyder woods
This page was built for publication: Geometric and combinatorial structures on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900727)