Oberwolfach problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Oberwolfach problem" in English language version.

refsWebsite

Global rank English rank

12doi.org

2^nd place

12ams.org

451^st place

277^th place

3arxiv.org

69^th place

59^th place

1harvard.edu

18^th place

17^th place

1uq.edu.au

3,558^th place

2,403^rd place

1mcmaster.ca

6,572^nd place

4,351^st place

1amc-journal.eu

low place

1cambridge.org

305^th place

264^th place

amc-journal.eu (Global: low place; English: low place)

Alspach, Brian; Bryant, Darryn; Horsley, Daniel; Maenhaut, Barbara; Scharaschkin, Victor (2016), "On factorisations of complete graphs into circulant graphs and the Oberwolfach problem", Ars Mathematica Contemporanea, 11 (1): 157–173, arXiv:1411.6047, doi:10.26493/1855-3974.770.150, MR 3546656

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Lenz, Hanfried; Ringel, Gerhard (1991), "A brief review on Egmont Köhler's mathematical work", Discrete Mathematics, 97 (1–3): 3–16, doi:10.1016/0012-365X(91)90416-Y, MR 1140782
Huang, Charlotte; Kotzig, Anton; Rosa, Alexander (1979), "On a variation of the Oberwolfach problem", Discrete Mathematics, 27 (3): 261–277, doi:10.1016/0012-365X(79)90162-6, MR 0541472
Glock, Stefan; Joos, Felix; Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk (2021), "Resolution of the Oberwolfach problem", Journal of the European Mathematical Society, 23 (8): 2511–2547, arXiv:1806.04644, doi:10.4171/jems/1060, MR 4269420
Häggkvist, Roland (1985), "A lemma on cycle decompositions", Cycles in graphs (Burnaby, B.C., 1982), North-Holland Math. Stud., vol. 115, Amsterdam: North-Holland, pp. 227–232, doi:10.1016/S0304-0208(08)73015-9, ISBN 978-0-444-87803-8, MR 0821524
Alspach, Brian; Häggkvist, Roland (1985), "Some observations on the Oberwolfach problem", Journal of Graph Theory, 9 (1): 177–187, doi:10.1002/jgt.3190090114, MR 0785659
Alspach, Brian; Schellenberg, P. J.; Stinson, D. R.; Wagner, David (1989), "The Oberwolfach problem and factors of uniform odd length cycles", Journal of Combinatorial Theory, Series A, 52 (1): 20–43, doi:10.1016/0097-3165(89)90059-9, MR 1008157
Hoffman, D. G.; Schellenberg, P. J. (1991), "The existence of $C_{k}$ -factorizations of $K_{2n}-F$ ", Discrete Mathematics, 97 (1–3): 243–250, doi:10.1016/0012-365X(91)90440-D, MR 1140806
Bryant, Darryn; Danziger, Peter (2011), "On bipartite 2-factorizations of $K_{n}-I$ and the Oberwolfach problem" (PDF), Journal of Graph Theory, 68 (1): 22–37, doi:10.1002/jgt.20538, MR 2833961
Deza, A.; Franek, F.; Hua, W.; Meszka, M.; Rosa, A. (2010), "Solutions to the Oberwolfach problem for orders 18 to 40" (PDF), Journal of Combinatorial Mathematics and Combinatorial Computing, 74: 95–102, MR 2675892
Bryant, Darryn; Scharaschkin, Victor (2009), "Complete solutions to the Oberwolfach problem for an infinite set of orders", Journal of Combinatorial Theory, Series B, 99 (6): 904–918, doi:10.1016/j.jctb.2009.03.003, MR 2558441
Alspach, Brian; Bryant, Darryn; Horsley, Daniel; Maenhaut, Barbara; Scharaschkin, Victor (2016), "On factorisations of complete graphs into circulant graphs and the Oberwolfach problem", Ars Mathematica Contemporanea, 11 (1): 157–173, arXiv:1411.6047, doi:10.26493/1855-3974.770.150, MR 3546656
Traetta, Tommaso (2013), "A complete solution to the two-table Oberwolfach problems", Journal of Combinatorial Theory, Series A, 120 (5): 984–997, doi:10.1016/j.jcta.2013.01.003, MR 3033656

arxiv.org (Global: 69^th place; English: 59^th place)

Glock, Stefan; Joos, Felix; Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk (2021), "Resolution of the Oberwolfach problem", Journal of the European Mathematical Society, 23 (8): 2511–2547, arXiv:1806.04644, doi:10.4171/jems/1060, MR 4269420
Salassa, F.; Dragotto, G.; Traetta, T.; Buratti, M.; Della Croce, F. (2019), Merging Combinatorial Design and Optimization: the Oberwolfach Problem, arXiv:1903.12112, Bibcode:2019arXiv190312112S
Alspach, Brian; Bryant, Darryn; Horsley, Daniel; Maenhaut, Barbara; Scharaschkin, Victor (2016), "On factorisations of complete graphs into circulant graphs and the Oberwolfach problem", Ars Mathematica Contemporanea, 11 (1): 157–173, arXiv:1411.6047, doi:10.26493/1855-3974.770.150, MR 3546656

cambridge.org (Global: 305^th place; English: 264^th place)

Kühn, D.; Osthus, D. (2021), "Extremal aspects of graph and hypergraph decomposition problems", in Lo, A.; Mycroft, R.; Perarnau, G.; Treglown, A. (eds.), Surveys in Combinatorics 2021, London Mathematical Society Lecture Note Series, vol. 470, Cambridge: Cambridge University Press, pp. 279–315, doi:10.1017/9781108999737.009 (inactive 31 January 2026), ISBN 9781009036214{{citation}}: CS1 maint: DOI inactive as of January 2026 (link)

doi.org (Global: 2^nd place; English: 2^nd place)

Lenz, Hanfried; Ringel, Gerhard (1991), "A brief review on Egmont Köhler's mathematical work", Discrete Mathematics, 97 (1–3): 3–16, doi:10.1016/0012-365X(91)90416-Y, MR 1140782
Huang, Charlotte; Kotzig, Anton; Rosa, Alexander (1979), "On a variation of the Oberwolfach problem", Discrete Mathematics, 27 (3): 261–277, doi:10.1016/0012-365X(79)90162-6, MR 0541472
Glock, Stefan; Joos, Felix; Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk (2021), "Resolution of the Oberwolfach problem", Journal of the European Mathematical Society, 23 (8): 2511–2547, arXiv:1806.04644, doi:10.4171/jems/1060, MR 4269420
Häggkvist, Roland (1985), "A lemma on cycle decompositions", Cycles in graphs (Burnaby, B.C., 1982), North-Holland Math. Stud., vol. 115, Amsterdam: North-Holland, pp. 227–232, doi:10.1016/S0304-0208(08)73015-9, ISBN 978-0-444-87803-8, MR 0821524
Alspach, Brian; Häggkvist, Roland (1985), "Some observations on the Oberwolfach problem", Journal of Graph Theory, 9 (1): 177–187, doi:10.1002/jgt.3190090114, MR 0785659
Alspach, Brian; Schellenberg, P. J.; Stinson, D. R.; Wagner, David (1989), "The Oberwolfach problem and factors of uniform odd length cycles", Journal of Combinatorial Theory, Series A, 52 (1): 20–43, doi:10.1016/0097-3165(89)90059-9, MR 1008157
Hoffman, D. G.; Schellenberg, P. J. (1991), "The existence of $C_{k}$ -factorizations of $K_{2n}-F$ ", Discrete Mathematics, 97 (1–3): 243–250, doi:10.1016/0012-365X(91)90440-D, MR 1140806
Bryant, Darryn; Danziger, Peter (2011), "On bipartite 2-factorizations of $K_{n}-I$ and the Oberwolfach problem" (PDF), Journal of Graph Theory, 68 (1): 22–37, doi:10.1002/jgt.20538, MR 2833961
Bryant, Darryn; Scharaschkin, Victor (2009), "Complete solutions to the Oberwolfach problem for an infinite set of orders", Journal of Combinatorial Theory, Series B, 99 (6): 904–918, doi:10.1016/j.jctb.2009.03.003, MR 2558441
Alspach, Brian; Bryant, Darryn; Horsley, Daniel; Maenhaut, Barbara; Scharaschkin, Victor (2016), "On factorisations of complete graphs into circulant graphs and the Oberwolfach problem", Ars Mathematica Contemporanea, 11 (1): 157–173, arXiv:1411.6047, doi:10.26493/1855-3974.770.150, MR 3546656
Traetta, Tommaso (2013), "A complete solution to the two-table Oberwolfach problems", Journal of Combinatorial Theory, Series A, 120 (5): 984–997, doi:10.1016/j.jcta.2013.01.003, MR 3033656
Kühn, D.; Osthus, D. (2021), "Extremal aspects of graph and hypergraph decomposition problems", in Lo, A.; Mycroft, R.; Perarnau, G.; Treglown, A. (eds.), Surveys in Combinatorics 2021, London Mathematical Society Lecture Note Series, vol. 470, Cambridge: Cambridge University Press, pp. 279–315, doi:10.1017/9781108999737.009 (inactive 31 January 2026), ISBN 9781009036214{{citation}}: CS1 maint: DOI inactive as of January 2026 (link)

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Salassa, F.; Dragotto, G.; Traetta, T.; Buratti, M.; Della Croce, F. (2019), Merging Combinatorial Design and Optimization: the Oberwolfach Problem, arXiv:1903.12112, Bibcode:2019arXiv190312112S

mcmaster.ca (Global: 6,572^nd place; English: 4,351^st place)

cas.mcmaster.ca

Deza, A.; Franek, F.; Hua, W.; Meszka, M.; Rosa, A. (2010), "Solutions to the Oberwolfach problem for orders 18 to 40" (PDF), Journal of Combinatorial Mathematics and Combinatorial Computing, 74: 95–102, MR 2675892

uq.edu.au (Global: 3,558^th place; English: 2,403^rd place)

people.smp.uq.edu.au

Bryant, Darryn; Danziger, Peter (2011), "On bipartite 2-factorizations of $K_{n}-I$ and the Oberwolfach problem" (PDF), Journal of Graph Theory, 68 (1): 22–37, doi:10.1002/jgt.20538, MR 2833961

Oberwolfach problem (English Wikipedia)

amc-journal.eu (Global: low place; English: low place)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

cambridge.org (Global: 305th place; English: 264th place)

doi.org (Global: 2nd place; English: 2nd place)

harvard.edu (Global: 18th place; English: 17th place)