If G is any graph, then afactor or spanning subgraph of G is a subgraph with vertexset V (G). A factorization of G is a set of factors of G that are pairwise edge-disjoint — no two have a common edge — and whose union is all of G.
KeywordsRegular Graph Hamilton Cycle Complete Bipartite Graph Span Subgraph Petersen Graph
Unable to display preview. Download preview PDF.