TheCover (Seminar DM)

Iz MaFiRaWiki


Tomaž Pisanski, Arjana Žitnik

Torek, 9. oktober 2012, od 10-12, Plemljev seminar, Jadranska 19

Torek, 26. marec 2013, od 10-12, Plemljev seminar, Jadranska 19

Povzetek: Each finite graph on n vertices determines a special (n − 1)-fold covering graph that we call TheCover. Several equivalent definitions and basic facts about this remarkable construction are presented. In particular, the connectivity, k-connectivity, bipartiteness, hamiltonicity, planarity are studied. By studying automorphisms of these covers we also understand the structure of their automorphism groups. We also show that TheCover of a 3-connected graph X is never a regular covering of X.

Glej tudi/See also

Seminar za diskretno matematiko

Osebna orodja