Tomaž Pisanski: Enumeration and generation of trivalent graphs in several variations; a motivation
Datum objave: 1. 11. 2010
Seminar za diskretno matematiko
Torek, 2. 11. 2010 od 10h do 12h, Plemljev seminar, Jadranska 19
Povzetek.
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.