J. Akiyama: Factorization and linear arboricity of graphs.
Thesis Univ. Tokyo 1982.

J. Akiyama/M. Kano: Factors and factorizations of graphs - 
a survey. J. Graph Theory 9 (1985), 1-42.

Y. Alavi/F. Chung/Ronald Graham/D. Hsu: Graph theory, combinatorics,
algorithms, and applications. 1991.

A. Amahashi: On factors with all degrees odd.
Graphs Comb. 1 (1985), 111-114.

I. Anderson: Perfect matchings of a graph.
J. Comb. Theory B 10 (1971), 183-186.

F. Baebler: U''ber die Zerlegung regula''rer Streckenkomplexe ungerader
Ordnung. Comm. Math. Helv. 10 (1938), 275-287.

D. Bauer/E. Schmeichel: Toughness, minimum degree, and the existence
of 2-factors. J. Graph Theory 18 (1994), 241-256.

H. Belck: Regula''re Faktoren von Graphen.
J. Reine u. Angew. Math. 188 (1950), 228-252.

B. Bollobas: Graph theory. Springer 1979.

B. Bollobas/A. Saito/N. Wormwald: Regular factors of regular graphs.
J. Graph Theory 9 (1985), 97-103.

H. Brahana: A proof of Petersen's theorem.
Ann. Math. 19 (1917), 59-63.

9938 Andries Brouwer/Arjeh Cohen/Arnold Neumaier: Distance-regular graphs.
Springer 1989, 490p. 3-540-50619-5.

23232 Peter Cameron: Strongly regular graphs. Internet 2001, 23p.

G. Chartrand/L. Nebesky: A note on 1-factors in graphs.
Period. Math. Hungar. 10 (1979), 41-46.

C. Chen: A survey of parity factors.
In Alavi/Chung/Graham/Hsu 1991, 106-118.

C. Chen: Extensions of some theorems on 1-factors.
Acta Math. Sci. ... (ca. 1996), ...

C. Chen/M. Kano: Odd and even factors of graphs with given properties.
Chinese Quart. J. Math. 7 (1992), 65-71.

A. Chetwynd/A. Hilton: Regular graphs of high degree are
1-factorizable. Proc. London MS 50 (1985), 193-206.

A. Chetwynd/A. Hilton: 1-factorizing regular graphs of high degree -
an improved bound. Discrete Math. 75 (1989), 103-112.

V. Chungphaisan: Factors of graphs and degree sequences.
Nanta Math. 9 (1976), 41-49.

Y. Egawa/H. Enomoto: Sufficient conditions for the existence of
k-factors. In Kulli 1989, 96-105.

Y. Egawa/M. Kano: Sufficient conditions for graphs to have
(g,f)-factors. Manuscript, 1990. Cited in 6945 Volkmann.

H. Enomoto: Toughness and the existence of k-factors II.
Graphs Comb. 2 (1986), 37-42.

H. Enomoto/B. Jackson/P. Katerinis/A. Saito: Toughness and the
existence of k-factors. J. Graph Theory 9 (1985), 87-95.

A. Errera: Une demonstration du theoreme de Petersen.
Mathesis 36 (1922), 56-61.

H. Fleischner: Spanning eulerian subgraphs, the splitting lemma,
and Petersen's theorem. Discrete Math. 101 (1992), 33-37.

O. Frink: A proof of Petersen's theorem.
Ann. Math. 27 (1926), 491-493.

Tibor Gallai: On the factorization of graphs.
Acta math. Ac. Sci. Hungar 1 (1950), 133-153.

K. Heinrich/P. Hell/D. Kirkpatrick/G. Liu: A simple existence
criterion for (g<f)-factors. Discrete Math. 85 (1990), 313-317.

T. Iida/T. Nishimura: An Ore-type condition for the existence
of k-factors in graphs. Graphs Comb. 7 (1991), 353-361.

A. Joentgen/Lutz Volkmann: Factors of locally almost regular graphs.
Bull. London MS 23 (1991), 121-122.

M. Kano: [a,b]-factorization of a graph.
J. Graph Theory 9 (1985), 129-146.

M. Kano: Factors of regular graphs.
J. Comb. Theory B 41 (1986), 27-36.

M. Kano/A. Saito: [a,b]-factors of graphs.
Discrete Math. 47 (1983), 113-116.

M. Kano/N. Tokushige: Binding numbers and f-factors of graphs.
J. Comb. Theory B 54 (1992), 213-221.

P. Katerinis: Some conditions for the existence of f-factors.
J. Graph Theory 9 (1985), 513-521.

P. Katerinis: Minimum degree of a graph and the existence of k-factors.
Proc. Indian Ac. Sci. Math. Sci. 94 (1985), 123-127.

P. Katerinis: A Chvatal-Erdo''s condition for an r-factor in a graph.
Ars Comb. 20-B (1985), 185-191.

P. Katerinis: Toughness of graphs and the existence of factors.
Discrete Math. 80 (1990), 81-92.

P. Katerinis: Regular factors in regular graphs.
Discrete Math. 113 (1993), 269-274.

P. Katerinis/D. Woodall: Binding number of graphs and the existence
of k-factors. Quart. J. Math. Oxford 38 (1987), 221-228.

T. Kirkman: On a problem in combinatorics.
Cambridge and Dublin Math. J. 2 (1847), 191-204.

2141 Denes Koenig: Theorie der endlichen und unendlichen Graphen.
Mit Eulers Abhandlung und Anha''ngen von H. Sachs und T. Gallai. Teubner 1986.

V. Kulli (ed.): Recent studies in graph theory. Vishwa 1989.

U. Lenkewitz/Lutz Volkmann: Neighbourhood and degree conditions for
the existence of regular factors. Ars Comb. ... (ca. 1996), ...

L. Lovasz: Subgraphs with prescribed valencies.
J. Comb. Theory 8 (1970), 391-416.

C. Mao-cheng (?): [a,b]-factorization of graphs.
J. Graph Theory 15 (1991), 283-301.

E. Mendelson/A. Rosa: One-factorizations of the complete graph -
a survey. J. Graph Theory 9 (1985), 43-65.

T. Niessen: Nash-Williams conditions and the existence of k-factors.
Ars Comb. 34 (1992), 251-266.

T. Niessen: [Sufficient conditions for the existence of regular
factors in graphs.] Dissertation RWTH Aachen 1994.

T. Niessen: Neighborhood unions and regular factors.
J. Graph Theory 19 (1995), 45-64.

T. Niessen: Regular factors of regular graphs and k-spectra.
... (ca. 1996), ...

T. Niessen: A Fan-type result for regular factors.
Ars Comb. ... (ca. 1996), ...

T. Niessen: Minimum degree, independence number and regular
factors. Graphs Comb. ... (ca. 1996), ...

T. Niessen/Lutz Volkmann: Class 1 conditions depending on the
minimum degree and the number of vertices of maximum degree.
J. Graph Theory 14 (1990), 225-246.

T. Nishimura: Independence number, connectivity, and r-factors.
J. Graph Theory 13 (1989), 63-69.

T. Nishimura: A degree condition for the existence of k-factors.
J. Graph Theory 16 (1992), 141-151.

Julius Petersen: Die Theorie der regula''ren graphs.
Acta Math. 15 (1891), 193-220.

J. Plesnik: Connectivity of regular graphs and the existence of
1-factors. Math. Casopis Slov. Ak. Vied. 22 (1972), 310-318.

J. Plesnik: Remarks on regular factors of regular graphs.
Czech. Math. J. 24 (1974), 292-300.

M. Reis'': U''ber eine Steinersche combinatorische Aufgabe, welche
im 45sten Bande dieses Journals, Seite 181, gestellt worden ist.
J. Reine u. Angew. Math. 56 (1859), 326-344.

A. Rosa/W. Wallis: Premature sets of 1-factors or how not to
schedule round robin tournaments. Discrete Appl. Math. 4 (1982), 291-297.

T. Scho''nberger: Ein Beweis des Petersenschen Graphensatzes.
Acta Litt. Acad. Sci. Szeged. 7 (1934), 51-57.

R. Singleton: There is no irregular Moore graph.
Am. Math. Monthly 75 (1968), 42-43.

P. Tait: Note on a theorem in the geometry of position.
Trans. Royal Soc. Edinburgh 29 (1880), 657-660.

24394 Terence Tao: Expansion in finite simple groups of Lie type.
Draft, Internet 2013, 300p.

C. Thomassen: A remark on the factor theorems of Lovasz and Tutte.
J. Graph Theory 5 (1981), 441-442.

N. Tokushige: Binding number and minimum degree for k-factors.
J. Graph Theory 13 (1989), 607-617.

J. Topp/P. Vestergaard: Odd factors of a graph.
Graphs Comb. 9 (1993), 371-381.

W. Tutte: The factorization of linear graphs.
J. London MS 22 (1947), 107-111.

W. Tutte: The factors of graphs. Can. J. Math. 4 (1952), 314-328.

W. Tutte: The 1-factors of oriented graphs.
Proc. AMS 4 (1953), 922-931.

W. Tutte: A short proof of the factor theorem for finite graphs.
Can. J. Math. 6 (1954), 347-352.

W. Tutte: The subgraph problem.
Ann. Discrete Math. 3 (1978), 289-295.

W. Tutte: Graph factors. Combinatorica 1 (1981), 79-97.

6945 Lutz Volkmann: Regular graphs, regular factors, and the impact
of Petersen's theorems. Jahrb. DMV 97 (1995), 19-42.

D. Woodall: The binding number of a graph and its Anderson number.
J. Comb. Theory B 15 (1973), 225-255.

D. Woodall: k-factors and neighbourhoods of independent sets in graphs.
J. London MS 41 (1990), 385-392.

C. Yuting/M. Kano: Some results on odd factors of graphs.
J. Graph Theory 12 (1988), 327-333.

C. Zhang/Y. Zhu: Factorizations of regular graphs.
J. Comb. Theory B 56 (1992), 74-89.