English

edit

Noun

edit

Euler genus

  1. (graph theory) The minimal integer n such that the given graph can be drawn without crossing itself on a sphere with n cross-caps or with n/2 handles.
  NODES
Note 1