Graph structure theorem (English Wikipedia)

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

refsWebsite

Global rank English rank

2^nd place

451^st place

277^th place

102^nd place

76^th place

ams.org

Robertson & Seymour (1993); Demaine, Hajiaghayi & Thilikos (2002)). Robertson, Neil; Seymour, P. D. (1993), "Excluding a graph with one crossing", in Robertson, Neil; Seymour, Paul (eds.), Graph Structure Theory: Proc. AMS–IMS–SIAM Joint Summer Research Conference on Graph Minors, Contemporary Mathematics, vol. 147, American Mathematical Society, pp. 669–675, doi:10.1090/conm/147/01206, ISBN 978-0-8218-5160-9, MR 1224738. Demaine, Erik D.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios M. (2002), "1.5-Approximation for treewidth of graphs excluding a graph with one crossing as a minor", Proc. 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2002), Lecture Notes in Computer Science, vol. 2462, Springer-Verlag, pp. 67–80, doi:10.1007/3-540-45753-4_8, hdl:2117/97497, ISBN 978-3-540-44186-1, MR 2091577.

Robertson & Seymour (1993); Demaine, Hajiaghayi & Thilikos (2002)). Robertson, Neil; Seymour, P. D. (1993), "Excluding a graph with one crossing", in Robertson, Neil; Seymour, Paul (eds.), Graph Structure Theory: Proc. AMS–IMS–SIAM Joint Summer Research Conference on Graph Minors, Contemporary Mathematics, vol. 147, American Mathematical Society, pp. 669–675, doi:10.1090/conm/147/01206, ISBN 978-0-8218-5160-9, MR 1224738. Demaine, Erik D.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios M. (2002), "1.5-Approximation for treewidth of graphs excluding a graph with one crossing as a minor", Proc. 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2002), Lecture Notes in Computer Science, vol. 2462, Springer-Verlag, pp. 67–80, doi:10.1007/3-540-45753-4_8, hdl:2117/97497, ISBN 978-3-540-44186-1, MR 2091577.

Robertson & Seymour (1993); Demaine, Hajiaghayi & Thilikos (2002)). Robertson, Neil; Seymour, P. D. (1993), "Excluding a graph with one crossing", in Robertson, Neil; Seymour, Paul (eds.), Graph Structure Theory: Proc. AMS–IMS–SIAM Joint Summer Research Conference on Graph Minors, Contemporary Mathematics, vol. 147, American Mathematical Society, pp. 669–675, doi:10.1090/conm/147/01206, ISBN 978-0-8218-5160-9, MR 1224738. Demaine, Erik D.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios M. (2002), "1.5-Approximation for treewidth of graphs excluding a graph with one crossing as a minor", Proc. 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2002), Lecture Notes in Computer Science, vol. 2462, Springer-Verlag, pp. 67–80, doi:10.1007/3-540-45753-4_8, hdl:2117/97497, ISBN 978-3-540-44186-1, MR 2091577.