(Q2799491)

English

Ringel–Youngs theorem

theorem on the number of colors needed for graphs embedded on higher genus surfaces

  • Heawood conjecture
In more languages
default for all languages
No label defined

No description defined

Statements

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit