The Factors of Graphs

  • W. T. Tutte
Part of the Modern Birkhäuser Classics book series (MBC)


A graph G consists of a non-null set V of objects called vertices together with a set E of objects called edges, the two sets having no common element. With each edge there are associated just two vertices, called its ends. Two or more edges may have the same pair of ends.


Finite Graph Blue Edge Singular Vertex Theorem Versus Finite Component 
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.


  1. 1.
    H. B. Belck, Reguldre Faktoren von Graphen, J. Reine Angew. Math., vol. 188 (1950), 228-252.MATHMathSciNetGoogle Scholar
  2. 2.
    T. Gallai, On factorization of graphs, Acta Mathematica Academiae Scientarum Hungaricae, vol. 1 (1950), 133-153.MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    P. Hall, On representation of subsets, J. London Math. Soc., vol. 10 (1934), 26-30.CrossRefGoogle Scholar
  4. 4.
    J. Petersen, Die Theorie der reguldren Graphs, Acta Math., vol. 15 (1891), 193-220.CrossRefMathSciNetGoogle Scholar
  5. 5.
    K. Rado, Factorization of even graphs, Quarterly J. Math., vol. 20 (1949), 95-104.CrossRefMathSciNetGoogle Scholar
  6. 6.
    W. T. Tutte, The factorization of linear graphs, J. London Math. Soc., vol. 22 (1947), 107-111.MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    W. T. Tutte, The factorization of locally finite graphs, Can. J. Math., vol. 1 (1950), 44-49.MathSciNetGoogle Scholar

Copyright information

© Birkhäuser Boston, a part of Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • W. T. Tutte
    • 1
  1. 1.The University of TorontoTorontoCanada

Personalised recommendations