Pages that link to "Item:Q1931272"
From MaRDI portal
The following pages link to Drawing planar 3-trees with given face areas (Q1931272):
Displayed 10 items.
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations (Q378246) (← links)
- On triangulating \(k\)-outerplanar graphs (Q479051) (← links)
- Table cartogram (Q1699289) (← links)
- On the area-universality of triangulations (Q1725766) (← links)
- All subgraphs of a wheel are 5-coupled-choosable (Q2115842) (← links)
- Triangulating Planar Graphs While Keeping the Pathwidth Small (Q2827827) (← links)
- Drawing Planar Graphs with Prescribed Face Areas (Q3181055) (← links)
- RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY (Q5076161) (← links)
- On Area-Universal Quadrangulations (Q5856667) (← links)
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality (Q6156090) (← links)