Robertson–Seymour theorem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Robertson–Seymour theorem" in English language version.

refsWebsite

Global rank English rank

10doi.org

2^nd place

4uni-hamburg.de

3,809^th place

5,200^th place

1combinatorics.org

low place

1nii.ac.jp

304^th place

1,952^nd place

combinatorics.org

Myrvold & Woodcock (2018). Myrvold, Wendy; Woodcock, Jennifer (2018), "A Large Set of Torus Obstructions and How They Were Discovered", The Electronic Journal of Combinatorics, 25 (1): P1.16, doi:10.37236/3797.

doi.org

Robertson & Seymour (2004). Robertson, Neil; Seymour, Paul (2004), "Graph Minors. XX. Wagner's conjecture", Journal of Combinatorial Theory, Series B, 92 (2): 325–357, doi:10.1016/j.jctb.2004.08.001.
Robertson and Seymour (1983, 2004); Diestel (2005, p. 333). Robertson, Neil; Seymour, Paul (1983), "Graph Minors. I. Excluding a forest", Journal of Combinatorial Theory, Series B, 35 (1): 39–61, doi:10.1016/0095-8956(83)90079-5. Robertson, Neil; Seymour, Paul (2004), "Graph Minors. XX. Wagner's conjecture", Journal of Combinatorial Theory, Series B, 92 (2): 325–357, doi:10.1016/j.jctb.2004.08.001. Diestel, Reinhard (2005), "Minors, Trees, and WQO", Graph Theory (PDF) (Electronic Edition 2005 ed.), Springer, pp. 326–367.
Diestel (2005, pp. 335–336); Lovász (2005), Section 3.3, pp. 78–79. Diestel, Reinhard (2005), "Minors, Trees, and WQO", Graph Theory (PDF) (Electronic Edition 2005 ed.), Springer, pp. 326–367. Lovász, László (2005), "Graph Minor Theory", Bulletin of the American Mathematical Society, New Series, 43 (1): 75–86, doi:10.1090/S0273-0979-05-01088-8.
Lovász (2005, p. 78). Lovász, László (2005), "Graph Minor Theory", Bulletin of the American Mathematical Society, New Series, 43 (1): 75–86, doi:10.1090/S0273-0979-05-01088-8.
Bienstock & Langston (1995), Corollary 2.1.1; Lovász (2005), Theorem 4, p. 78. Lovász, László (2005), "Graph Minor Theory", Bulletin of the American Mathematical Society, New Series, 43 (1): 75–86, doi:10.1090/S0273-0979-05-01088-8.
Lovász (2005, pp. 76–77). Lovász, László (2005), "Graph Minor Theory", Bulletin of the American Mathematical Society, New Series, 43 (1): 75–86, doi:10.1090/S0273-0979-05-01088-8.
Myrvold & Woodcock (2018). Myrvold, Wendy; Woodcock, Jennifer (2018), "A Large Set of Torus Obstructions and How They Were Discovered", The Electronic Journal of Combinatorics, 25 (1): P1.16, doi:10.37236/3797.
Kawarabayashi, Kobayashi & Reed (2012) Kawarabayashi, Ken-ichi; Kobayashi, Yusuke; Reed, Bruce (2012), "The disjoint paths problem in quadratic time" (PDF), Journal of Combinatorial Theory, Series B, 102 (2): 424–435, doi:10.1016/j.jctb.2011.07.004.
Robertson & Seymour (1995); Bienstock & Langston (1995), Theorem 2.1.4 and Corollary 2.1.5; Lovász (2005), Theorem 11, p. 83. Robertson, Neil; Seymour, Paul (1995), "Graph Minors. XIII. The disjoint paths problem", Journal of Combinatorial Theory, Series B, 63 (1): 65–110, doi:10.1006/jctb.1995.1006. Lovász, László (2005), "Graph Minor Theory", Bulletin of the American Mathematical Society, New Series, 43 (1): 75–86, doi:10.1090/S0273-0979-05-01088-8.
Fellows & Langston (1988); Bienstock & Langston (1995), Section 6. Fellows, Michael R.; Langston, Michael A. (1988), "Nonconstructive tools for proving polynomial-time decidability", Journal of the ACM, 35 (3): 727–739, doi:10.1145/44483.44491.

nii.ac.jp

research.nii.ac.jp

Kawarabayashi, Kobayashi & Reed (2012) Kawarabayashi, Ken-ichi; Kobayashi, Yusuke; Reed, Bruce (2012), "The disjoint paths problem in quadratic time" (PDF), Journal of Combinatorial Theory, Series B, 102 (2): 424–435, doi:10.1016/j.jctb.2011.07.004.

uni-hamburg.de

math.uni-hamburg.de

Robertson and Seymour (1983, 2004); Diestel (2005, p. 333). Robertson, Neil; Seymour, Paul (1983), "Graph Minors. I. Excluding a forest", Journal of Combinatorial Theory, Series B, 35 (1): 39–61, doi:10.1016/0095-8956(83)90079-5. Robertson, Neil; Seymour, Paul (2004), "Graph Minors. XX. Wagner's conjecture", Journal of Combinatorial Theory, Series B, 92 (2): 325–357, doi:10.1016/j.jctb.2004.08.001. Diestel, Reinhard (2005), "Minors, Trees, and WQO", Graph Theory (PDF) (Electronic Edition 2005 ed.), Springer, pp. 326–367.
Diestel (2005, p. 355). Diestel, Reinhard (2005), "Minors, Trees, and WQO", Graph Theory (PDF) (Electronic Edition 2005 ed.), Springer, pp. 326–367.
Diestel (2005, pp. 335–336); Lovász (2005), Section 3.3, pp. 78–79. Diestel, Reinhard (2005), "Minors, Trees, and WQO", Graph Theory (PDF) (Electronic Edition 2005 ed.), Springer, pp. 326–367. Lovász, László (2005), "Graph Minor Theory", Bulletin of the American Mathematical Society, New Series, 43 (1): 75–86, doi:10.1090/S0273-0979-05-01088-8.
Diestel (2005, p. 334). Diestel, Reinhard (2005), "Minors, Trees, and WQO", Graph Theory (PDF) (Electronic Edition 2005 ed.), Springer, pp. 326–367.