Telecharger Cours

Convex Drawings of 3-Connected Plane Graphs - TU Berlin

An internally 3-connected map M with n vertices can be drawn internally convex on the (n?2??S )×(n?2??S ) grid, where S is a minimal Schnyder wood of M+.



Download