Abstract: For a set SS of graphs, a perfect SS-packing (SS-factor) of a graph GG is a set of mutually vertex-disjoint subgraphs of GG that each are isomorphic to a member of SS and that together contain all vertices of GG. If GG allows a covering (locally bijective homomorphism) to a graph HH, i.e., a vertex mapping f:VG→VHf:VG→VH satisfying the property that f(u)f(v)f(u)f(v) belongs to EHEH whenever the edge uvuv belongs to EGEG such that for every u∈VGu∈VG the restriction of ff to the neighborhood of uu is bijective, then GG is an HH-cover. For...
(read more)
Topics: 
Combinatorics
Discrete mathematics