Graph factorization (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Graph factorization" in English language version.

refsWebsite

Global rank English rank

5doi.org

2^nd place

2uni-hamburg.de

3,809^th place

5,200^th place

2zenodo.org

621^st place

380^th place

1uiuc.edu

3,087^th place

2,519^th place

1worldcat.org

5^th place

doi.org

Chetwynd & Hilton (1985). Niessen (1994). Perkovic & Reed (1997). West. Chetwynd, A. G.; Hilton, A. J. W. (1985), "Regular graphs of high degree are 1-factorizable", Proceedings of the London Mathematical Society, 50 (2): 193–206, doi:10.1112/plms/s3-50.2.193. Niessen, Thomas (1994), "How to find overfull subgraphs in graphs with large maximum degree", Discrete Applied Mathematics, 51 (1–2): 117–125, doi:10.1016/0166-218X(94)90101-5. Perkovic, L.; Reed, B. (1997), "Edge coloring regular graphs of high degree", Discrete Mathematics, 165–166: 567–578, doi:10.1016/S0012-365X(96)00202-6. West, Douglas B. "1-Factorization Conjecture (1985?)". Open Problems – Graph Theory and Combinatorics. Retrieved 2010-01-09.
Wallis, W. D. (1997), "16. Perfect Factorizations", One-factorizations, Mathematics and Its Applications, vol. 390 (1 ed.), Springer US, p. 125, doi:10.1007/978-1-4757-2564-3_16, ISBN 978-0-7923-4323-3
Bryant, Darryn; Maenhaut, Barbara M.; Wanless, Ian M. (May 2002), "A Family of Perfect Factorisations of Complete Bipartite Graphs", Journal of Combinatorial Theory, A, 98 (2): 328–342, doi:10.1006/jcta.2001.3240, ISSN 0097-3165
Petersen (1891), §9, p. 200. Harary (1969), Theorem 9.9, p. 90. See Diestel (2005), Corollary 2.1.5, p. 39 for a proof. Petersen, Julius (1891), "Die Theorie der regulären graphs" (PDF), Acta Mathematica, 15: 193–220, doi:10.1007/BF02392606. Harary, Frank (1969), Graph Theory, Addison-Wesley, ISBN 0-201-02787-9, Chapter 9: "Factorization". Diestel, Reinhard (2005), Graph Theory (3rd ed.), Springer, ISBN 3-540-26182-6, Chapter 2: "Matching, covering and packing". Electronic edition.
Petersen (1891), §6, p. 198. Petersen, Julius (1891), "Die Theorie der regulären graphs" (PDF), Acta Mathematica, 15: 193–220, doi:10.1007/BF02392606.

uiuc.edu

math.uiuc.edu

Chetwynd & Hilton (1985). Niessen (1994). Perkovic & Reed (1997). West. Chetwynd, A. G.; Hilton, A. J. W. (1985), "Regular graphs of high degree are 1-factorizable", Proceedings of the London Mathematical Society, 50 (2): 193–206, doi:10.1112/plms/s3-50.2.193. Niessen, Thomas (1994), "How to find overfull subgraphs in graphs with large maximum degree", Discrete Applied Mathematics, 51 (1–2): 117–125, doi:10.1016/0166-218X(94)90101-5. Perkovic, L.; Reed, B. (1997), "Edge coloring regular graphs of high degree", Discrete Mathematics, 165–166: 567–578, doi:10.1016/S0012-365X(96)00202-6. West, Douglas B. "1-Factorization Conjecture (1985?)". Open Problems – Graph Theory and Combinatorics. Retrieved 2010-01-09.

uni-hamburg.de

math.uni-hamburg.de

Harary (1969), Theorem 9.2, p. 85. Diestel (2005), Corollary 2.1.3, p. 37. Harary, Frank (1969), Graph Theory, Addison-Wesley, ISBN 0-201-02787-9, Chapter 9: "Factorization". Diestel, Reinhard (2005), Graph Theory (3rd ed.), Springer, ISBN 3-540-26182-6, Chapter 2: "Matching, covering and packing". Electronic edition.
Petersen (1891), §9, p. 200. Harary (1969), Theorem 9.9, p. 90. See Diestel (2005), Corollary 2.1.5, p. 39 for a proof. Petersen, Julius (1891), "Die Theorie der regulären graphs" (PDF), Acta Mathematica, 15: 193–220, doi:10.1007/BF02392606. Harary, Frank (1969), Graph Theory, Addison-Wesley, ISBN 0-201-02787-9, Chapter 9: "Factorization". Diestel, Reinhard (2005), Graph Theory (3rd ed.), Springer, ISBN 3-540-26182-6, Chapter 2: "Matching, covering and packing". Electronic edition.

worldcat.org

Bryant, Darryn; Maenhaut, Barbara M.; Wanless, Ian M. (May 2002), "A Family of Perfect Factorisations of Complete Bipartite Graphs", Journal of Combinatorial Theory, A, 98 (2): 328–342, doi:10.1006/jcta.2001.3240, ISSN 0097-3165

zenodo.org

Petersen (1891), §9, p. 200. Harary (1969), Theorem 9.9, p. 90. See Diestel (2005), Corollary 2.1.5, p. 39 for a proof. Petersen, Julius (1891), "Die Theorie der regulären graphs" (PDF), Acta Mathematica, 15: 193–220, doi:10.1007/BF02392606. Harary, Frank (1969), Graph Theory, Addison-Wesley, ISBN 0-201-02787-9, Chapter 9: "Factorization". Diestel, Reinhard (2005), Graph Theory (3rd ed.), Springer, ISBN 3-540-26182-6, Chapter 2: "Matching, covering and packing". Electronic edition.
Petersen (1891), §6, p. 198. Petersen, Julius (1891), "Die Theorie der regulären graphs" (PDF), Acta Mathematica, 15: 193–220, doi:10.1007/BF02392606.