Enumeration and generation of trivalent graphs in several variations; a motivation (Seminar DM)

Iz MaFiRaWiki

Enumeration and generation of trivalent graphs in several variations; a motivation

Tomaž Pisanski


Torek, 2. november 2010, od 10-12, Plemljev seminar, Jadranska 19


It turns out that there exist numerous useful variants of trivalent graphs. Some are needed in connection with maps, hypermaps, configurations, polytopes, benzenoid systems, or covering graphs. In this talk we briefly explore these connections and give motivation why some decorated trivalent graphs should be enumerated and generated.


Glej tudi/See also


Seminar za diskretno matematiko

Osebna orodja