Arjana Žitnik, TheCover, 2. del

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 such covers we also understand the structure of their automorphism group. We also show that TheCover of a 3-connected graph X is never a regular covering of X.