Skip to main content

Tomaž Pisanski: TheCover

Date of publication: 7. 10. 2012
Discrete mathematics seminar
Torek, 9. 10. 2012 od 10h do 12h, 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.