If G is any graph, then a factor or spanning subgraph of G is a subgraph with vertex-set 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.


Regular Graph Hamilton Cycle Complete Bipartite Graph Span Subgraph Petersen Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • W. D. Wallis
    • 1
  1. 1.Department of MathematicsSouthern Illinois UniversityCarbondaleUSA

Personalised recommendations