User:Qadir Hosseini1360/sandbox: Difference between revisions
No edit summary |
No edit summary |
||
| Line 29: | Line 29: | ||
Establishment of necessary and sufficient conditions for decomposing the complete graph of even order minus a 1-factor into even cycles and the complete graph of odd order into odd cycles |
Establishment of necessary and sufficient conditions for decomposing the complete graph of even order minus a 1-factor into even cycles and the complete graph of odd order into odd cycles |
||
'''References''' |
|||
1) Discrere mathematics Volume 299,Issues 1-3, 28 august 2005, pages 269-287 Graph theory of Brian Alspach. |
|||
2) Journal of combinatorial theory. Series B volume 81, Issue 1, January 2001, Pages 77-99. Cycle decomposition of K_n & K_n-I |
|||
Revision as of 06:18, 23 March 2014
Final Project Outline
Mathematician: Brian Alspach
Brian Alspach is one of the most influential graph theorists of the past four decades. His works and fundamental discoveries have had significant impact on several mainstream subjects of graph theory.
1. Early life [1]
2. Education
a) Undergraduate
b) Graduate
c) Doctorate
3. Career
4. Mathematical contributions
5. Publications [2]
Cycle decomposition
Cycle decomposition of K_n & K_n-I.[3]
Establishment of necessary and sufficient conditions for decomposing the complete graph of even order minus a 1-factor into even cycles and the complete graph of odd order into odd cycles
References
1) Discrere mathematics Volume 299,Issues 1-3, 28 august 2005, pages 269-287 Graph theory of Brian Alspach.
2) Journal of combinatorial theory. Series B volume 81, Issue 1, January 2001, Pages 77-99. Cycle decomposition of K_n & K_n-I