그래프 마이너 (Korean Wikipedia)

Analysis of information sources in references of the Wikipedia article "그래프 마이너" in Korean language version.

refsWebsite

Global rank Korean rank

27doi.org

2^nd place

3^rd place

12semanticscholar.org

11^th place

310^th place

8ams.org

451^st place

121^st place

4arxiv.org

69^th place

54^th place

3uni-hamburg.de

3,809^th place

2,462^nd place

3harvard.edu

18^th place

27^th place

2uu.nl

2,467^th place

1,585^th place

2gatech.edu

4,448^th place

2,217^th place

1jstor.org

26^th place

70^th place

1stanford.edu

179^th place

146^th place

1erikdemaine.org

low place

1cwi.nl

low place

1psu.edu

207^th place

220^th place

1lirmm.fr

low place

1worldcat.org

5^th place

11^th place

ams.org

Alon, Seymour & Thomas (1990); Plotkin, Rao & Smith (1994); Reed & Wood (2009). Alon, Noga; Seymour, Paul; Thomas, Robin (1990), “A separator theorem for nonplanar graphs”, 《미국 수학회》 3 (4): 801–808, doi:10.2307/1990903, JSTOR 1990903, MR 1065053 . Plotkin, Serge; Rao, Satish; Smith, Warren D. (1994), 〈Shallow excluded minors and improved graph decompositions〉, 《Proc. 5th ACM–SIAM Symp. on Discrete Algorithms (SODA 1994)》, 462–470쪽 . Reed, Bruce; Wood, David R. (2009), “A linear-time algorithm to find a separator in a graph excluding a minor”, 《ACM Transactions on Algorithms》 5 (4): Article 39, doi:10.1145/1597036.1597043, S2CID 760001 .
Thomas (1999); Pegg (2002). Thomas, Robin (1999), 〈Recent excluded minor theorems for graphs〉, 《Surveys in combinatorics, 1999 (Canterbury)》 (PDF), London Math. Soc. Lecture Note Ser. 267, Cambridge: Cambridge Univ. Press, 201–222쪽, MR 1725004 . Pegg, Ed Jr. (2002), “Book Review: The Colossal Book of Mathematics” (PDF), 《Notices of the American Mathematical Society》 49 (9): 1084–1086, Bibcode:2002ITED...49.1084A, doi:10.1109/TED.2002.1003756 .
Eppstein (2000); Demaine & Hajiaghayi (2004). Eppstein, David (2000), “Diameter and treewidth in minor-closed graph families”, 《Algorithmica》 27 (3): 275–291, arXiv:math.CO/9907126, doi:10.1007/s004530010020, MR 1759751, S2CID 3172160 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2004), “Diameter and treewidth in minor-closed graph families, revisited”, 《Algorithmica》 40 (3): 211–215, doi:10.1007/s00453-004-1106-1, S2CID 390856 .
Ding (1996). Ding, Guoli (1996), “Excluding a long double path minor”, 《Journal of Combinatorial Theory》, Series B 66 (1): 11–23, doi:10.1006/jctb.1996.0002, MR 1368512 .
Nešetřil & Ossona de Mendez (2012). Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), 《Sparsity: Graphs, Structures, and Algorithms》, Algorithms and Combinatorics 28, Springer, 62–65쪽, doi:10.1007/978-3-642-27875-4, ISBN 978-3-642-27874-7, MR 2920058 .
Nešetřil & Ossona de Mendez (2012), pp. 319–321. Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), 《Sparsity: Graphs, Structures, and Algorithms》, Algorithms and Combinatorics 28, Springer, 62–65쪽, doi:10.1007/978-3-642-27875-4, ISBN 978-3-642-27874-7, MR 2920058 .
Geelen, Jim; Gerards, Bert; Reed, Bruce; Seymour, Paul; Vetta, Adrian (2009), “On the odd-minor variant of Hadwiger's conjecture”, 《Journal of Combinatorial Theory》, Series B 99 (1): 20–29, doi:10.1016/j.jctb.2008.03.006, MR 2467815 .
Chudnovsky, Maria; Kalai, Gil; Nevo, Eran; Novik, Isabella; Seymour, Paul (2016), “Bipartite minors”, 《Journal of Combinatorial Theory》, Series B 116: 219–228, arXiv:1312.0210, doi:10.1016/j.jctb.2015.08.001, MR 3425242, S2CID 14571660 .

arxiv.org

Grohe (2003) Grohe, Martin (2003), “Local tree-width, excluded minors, and approximation algorithms”, 《Combinatorica》 23 (4): 613–632, arXiv:math/0001128, doi:10.1007/s00493-003-0037-9, S2CID 11751235 .
Eppstein (2000); Demaine & Hajiaghayi (2004). Eppstein, David (2000), “Diameter and treewidth in minor-closed graph families”, 《Algorithmica》 27 (3): 275–291, arXiv:math.CO/9907126, doi:10.1007/s004530010020, MR 1759751, S2CID 3172160 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2004), “Diameter and treewidth in minor-closed graph families, revisited”, 《Algorithmica》 40 (3): 211–215, doi:10.1007/s00453-004-1106-1, S2CID 390856 .
Błasiok 외. (2015) Błasiok, Jarosław; Kamiński, Marcin; Raymond, Jean-Florent; Trunck, Théophile (2015), 《Induced minors and well-quasi-ordering》, arXiv:1510.07135, Bibcode:2015arXiv151007135B .
Chudnovsky, Maria; Kalai, Gil; Nevo, Eran; Novik, Isabella; Seymour, Paul (2016), “Bipartite minors”, 《Journal of Combinatorial Theory》, Series B 116: 219–228, arXiv:1312.0210, doi:10.1016/j.jctb.2015.08.001, MR 3425242, S2CID 14571660 .

cwi.nl

ir.cwi.nl

Geelen, Jim; Gerards, Bert; Reed, Bruce; Seymour, Paul; Vetta, Adrian (2009), “On the odd-minor variant of Hadwiger's conjecture”, 《Journal of Combinatorial Theory》, Series B 99 (1): 20–29, doi:10.1016/j.jctb.2008.03.006, MR 2467815 .

doi.org

dx.doi.org

Lovász (2006), p. 77; Wagner (1937a). Lovász, László (2006), “Graph minor theory”, 《미국 수학회》 43 (1): 75–86, doi:10.1090/S0273-0979-05-01088-8 . Wagner, Klaus (1937a), “Über eine Eigenschaft der ebenen Komplexe”, 《Math. Ann.》 114: 570–590, doi:10.1007/BF01594196, S2CID 123534907 .
Lovász (2006), theorem 4, p. 78; Robertson & Seymour (2004). Lovász, László (2006), “Graph minor theory”, 《미국 수학회》 43 (1): 75–86, doi:10.1090/S0273-0979-05-01088-8 . Robertson, Neil; Seymour, Paul D. (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 & Seymour (1995). Robertson, Neil; Seymour, Paul D. (1995), “Graph Minors. XIII. The disjoint paths problem”, 《Journal of Combinatorial Theory, Series B》 63 (1): 65–110, doi:10.1006/jctb.1995.1006 .
Fellows & Langston (1988). 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, S2CID 16587284 .
Diestel (2005), Chapter 12: Minors, Trees, and WQO; Robertson & Seymour (2004). Diestel, Reinhard (2005), 《Graph Theory》 3판, Berlin, New York: Springer-Verlag, ISBN 978-3-540-26183-4 . Robertson, Neil; Seymour, Paul D. (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 .
Lovász (2006), p. 76. Lovász, László (2006), “Graph minor theory”, 《미국 수학회》 43 (1): 75–86, doi:10.1090/S0273-0979-05-01088-8 .
Lovász (2006), pp. 80–82; Robertson & Seymour (2003). Lovász, László (2006), “Graph minor theory”, 《미국 수학회》 43 (1): 75–86, doi:10.1090/S0273-0979-05-01088-8 . Robertson, Neil; Seymour, Paul D. (2003), “Graph Minors. XVI. Excluding a non-planar graph”, 《Journal of Combinatorial Theory, Series B》 89 (1): 43–76, doi:10.1016/S0095-8956(03)00042-X .
Mader (1967). Mader, Wolfgang (1967), “Homomorphieeigenschaften und mittlere Kantendichte von Graphen”, 《Mathematische Annalen》 174 (4): 265–268, doi:10.1007/BF01364272, S2CID 120261785 .
Kostochka (1982); Kostochka (1984); Thomason (1984); Thomason (2001). Kostochka, Alexandr V. (1982), “The minimum Hadwiger number for graphs with a given mean degree of vertices”, 《Metody Diskret. Analiz.》 (러시아어) 38: 37–58 . Kostochka, Alexandr V. (1984), “Lower bound of the Hadwiger number of graphs by their average degree”, 《Combinatorica》 4 (4): 307–316, doi:10.1007/BF02579141, S2CID 15736799 . Thomason, Andrew (1984), “An extremal function for contractions of graphs”, 《Mathematical Proceedings of the Cambridge Philosophical Society》 95 (2): 261–265, Bibcode:1983MPCPS..95..261T, doi:10.1017/S0305004100061521, S2CID 124801301 . Thomason, Andrew (2001), “The extremal function for complete minors”, 《Journal of Combinatorial Theory, Series B》 81 (2): 318–338, doi:10.1006/jctb.2000.2013 .
Alon, Seymour & Thomas (1990); Plotkin, Rao & Smith (1994); Reed & Wood (2009). Alon, Noga; Seymour, Paul; Thomas, Robin (1990), “A separator theorem for nonplanar graphs”, 《미국 수학회》 3 (4): 801–808, doi:10.2307/1990903, JSTOR 1990903, MR 1065053 . Plotkin, Serge; Rao, Satish; Smith, Warren D. (1994), 〈Shallow excluded minors and improved graph decompositions〉, 《Proc. 5th ACM–SIAM Symp. on Discrete Algorithms (SODA 1994)》, 462–470쪽 . Reed, Bruce; Wood, David R. (2009), “A linear-time algorithm to find a separator in a graph excluding a minor”, 《ACM Transactions on Algorithms》 5 (4): Article 39, doi:10.1145/1597036.1597043, S2CID 760001 .
Grohe (2003) Grohe, Martin (2003), “Local tree-width, excluded minors, and approximation algorithms”, 《Combinatorica》 23 (4): 613–632, arXiv:math/0001128, doi:10.1007/s00493-003-0037-9, S2CID 11751235 .
Robertson, Seymour & Thomas (1993). Robertson, Neil; Seymour, Paul; Thomas, Robin (1993), “Hadwiger's conjecture for K₆-free graphs” (PDF), 《Combinatorica》 13 (3): 279–361, doi:10.1007/BF01202354, S2CID 9608738 .
Thomas (1999); Pegg (2002). Thomas, Robin (1999), 〈Recent excluded minor theorems for graphs〉, 《Surveys in combinatorics, 1999 (Canterbury)》 (PDF), London Math. Soc. Lecture Note Ser. 267, Cambridge: Cambridge Univ. Press, 201–222쪽, MR 1725004 . Pegg, Ed Jr. (2002), “Book Review: The Colossal Book of Mathematics” (PDF), 《Notices of the American Mathematical Society》 49 (9): 1084–1086, Bibcode:2002ITED...49.1084A, doi:10.1109/TED.2002.1003756 .
Robertson & Seymour (1983). 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 .
Lovász (2006), Theorem 9, p. 81; Robertson & Seymour (1986). Lovász, László (2006), “Graph minor theory”, 《미국 수학회》 43 (1): 75–86, doi:10.1090/S0273-0979-05-01088-8 . Robertson, Neil; Seymour, Paul D. (1986), “Graph minors. V. Excluding a planar graph”, 《Journal of Combinatorial Theory, Series B》 41 (1): 92–114, doi:10.1016/0095-8956(86)90030-4
Eppstein (2000); Demaine & Hajiaghayi (2004). Eppstein, David (2000), “Diameter and treewidth in minor-closed graph families”, 《Algorithmica》 27 (3): 275–291, arXiv:math.CO/9907126, doi:10.1007/s004530010020, MR 1759751, S2CID 3172160 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2004), “Diameter and treewidth in minor-closed graph families, revisited”, 《Algorithmica》 40 (3): 211–215, doi:10.1007/s00453-004-1106-1, S2CID 390856 .
Robertson & Seymour (1993); Demaine, Hajiaghayi & Thilikos (2002). Robertson, Neil; Seymour, Paul D. (1993), 〈Excluding a graph with one crossing〉, Robertson, Neil; Seymour, Paul, 《Graph Structure Theory: Proc. AMS–IMS–SIAM Joint Summer Research Conference on Graph Minors》, Contemporary Mathematics 147, 미국 수학회, 669–675쪽 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi; 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 2462, Springer-Verlag, 67–80쪽, doi:10.1007/3-540-45753-4_8
Wagner (1937a); Wagner (1937b); Hall (1943). Wagner, Klaus (1937a), “Über eine Eigenschaft der ebenen Komplexe”, 《Math. Ann.》 114: 570–590, doi:10.1007/BF01594196, S2CID 123534907 . Wagner, Klaus (1937b), “Über eine Erweiterung des Satzes von Kuratowski”, 《Deutsche Mathematik》 2: 280–285 . Hall, Dick Wick (1943), “A note on primitive skew curves”, 《Bulletin of the American Mathematical Society》 49 (12): 935–936, doi:10.1090/S0002-9904-1943-08065-2 .
Ding (1996). Ding, Guoli (1996), “Excluding a long double path minor”, 《Journal of Combinatorial Theory》, Series B 66 (1): 11–23, doi:10.1006/jctb.1996.0002, MR 1368512 .
Nešetřil & Ossona de Mendez (2012). Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), 《Sparsity: Graphs, Structures, and Algorithms》, Algorithms and Combinatorics 28, Springer, 62–65쪽, doi:10.1007/978-3-642-27875-4, ISBN 978-3-642-27874-7, MR 2920058 .
Nešetřil & Ossona de Mendez (2012), pp. 319–321. Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), 《Sparsity: Graphs, Structures, and Algorithms》, Algorithms and Combinatorics 28, Springer, 62–65쪽, doi:10.1007/978-3-642-27875-4, ISBN 978-3-642-27874-7, MR 2920058 .
Kawarabayashi, Ken-ichi; Reed, Bruce; Wollan, Paul (2011), 〈The graph minor algorithm with parity conditions〉, 《52nd Annual IEEE Symposium on Foundations of Computer Science》, Institute of Electrical and Electronics Engineers, 27–36쪽, doi:10.1109/focs.2011.52, S2CID 17385711 .
Geelen, Jim; Gerards, Bert; Reed, Bruce; Seymour, Paul; Vetta, Adrian (2009), “On the odd-minor variant of Hadwiger's conjecture”, 《Journal of Combinatorial Theory》, Series B 99 (1): 20–29, doi:10.1016/j.jctb.2008.03.006, MR 2467815 .
Chudnovsky, Maria; Kalai, Gil; Nevo, Eran; Novik, Isabella; Seymour, Paul (2016), “Bipartite minors”, 《Journal of Combinatorial Theory》, Series B 116: 219–228, arXiv:1312.0210, doi:10.1016/j.jctb.2015.08.001, MR 3425242, S2CID 14571660 .
Kawarabayashi, Kobayashi & Reed (2012). Kawarabayashi, Ken-ichi; Kobayashi, Yusuke; Reed, Bruce (March 2012), “The disjoint paths problem in quadratic time”, 《Journal of Combinatorial Theory, Series B》 102 (2): 424–435, doi:10.1016/j.jctb.2011.07.004
Johnson, David S. (1987). 《The NP-completeness column: An ongoing guide (edition 19)》. 《Journal of Algorithms》 8. 285–303쪽. CiteSeerX 10.1.1.114.3864. doi:10.1016/0196-6774(87)90043-5.
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. (2012년 9월 1일). 《Fast Minor Testing in Planar Graphs》 (PDF). 《Algorithmica》 (영어) 64. 69–84쪽. doi:10.1007/s00453-011-9563-9. ISSN 0178-4617. S2CID 6204674.

erikdemaine.org

Eppstein (2000); Demaine & Hajiaghayi (2004). Eppstein, David (2000), “Diameter and treewidth in minor-closed graph families”, 《Algorithmica》 27 (3): 275–291, arXiv:math.CO/9907126, doi:10.1007/s004530010020, MR 1759751, S2CID 3172160 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2004), “Diameter and treewidth in minor-closed graph families, revisited”, 《Algorithmica》 40 (3): 211–215, doi:10.1007/s00453-004-1106-1, S2CID 390856 .

gatech.edu

math.gatech.edu

Robertson, Seymour & Thomas (1993). Robertson, Neil; Seymour, Paul; Thomas, Robin (1993), “Hadwiger's conjecture for K₆-free graphs” (PDF), 《Combinatorica》 13 (3): 279–361, doi:10.1007/BF01202354, S2CID 9608738 .

people.math.gatech.edu

Thomas (1999); Pegg (2002). Thomas, Robin (1999), 〈Recent excluded minor theorems for graphs〉, 《Surveys in combinatorics, 1999 (Canterbury)》 (PDF), London Math. Soc. Lecture Note Ser. 267, Cambridge: Cambridge Univ. Press, 201–222쪽, MR 1725004 . Pegg, Ed Jr. (2002), “Book Review: The Colossal Book of Mathematics” (PDF), 《Notices of the American Mathematical Society》 49 (9): 1084–1086, Bibcode:2002ITED...49.1084A, doi:10.1109/TED.2002.1003756 .

harvard.edu

adsabs.harvard.edu

Kostochka (1982); Kostochka (1984); Thomason (1984); Thomason (2001). Kostochka, Alexandr V. (1982), “The minimum Hadwiger number for graphs with a given mean degree of vertices”, 《Metody Diskret. Analiz.》 (러시아어) 38: 37–58 . Kostochka, Alexandr V. (1984), “Lower bound of the Hadwiger number of graphs by their average degree”, 《Combinatorica》 4 (4): 307–316, doi:10.1007/BF02579141, S2CID 15736799 . Thomason, Andrew (1984), “An extremal function for contractions of graphs”, 《Mathematical Proceedings of the Cambridge Philosophical Society》 95 (2): 261–265, Bibcode:1983MPCPS..95..261T, doi:10.1017/S0305004100061521, S2CID 124801301 . Thomason, Andrew (2001), “The extremal function for complete minors”, 《Journal of Combinatorial Theory, Series B》 81 (2): 318–338, doi:10.1006/jctb.2000.2013 .
Thomas (1999); Pegg (2002). Thomas, Robin (1999), 〈Recent excluded minor theorems for graphs〉, 《Surveys in combinatorics, 1999 (Canterbury)》 (PDF), London Math. Soc. Lecture Note Ser. 267, Cambridge: Cambridge Univ. Press, 201–222쪽, MR 1725004 . Pegg, Ed Jr. (2002), “Book Review: The Colossal Book of Mathematics” (PDF), 《Notices of the American Mathematical Society》 49 (9): 1084–1086, Bibcode:2002ITED...49.1084A, doi:10.1109/TED.2002.1003756 .
Błasiok 외. (2015) Błasiok, Jarosław; Kamiński, Marcin; Raymond, Jean-Florent; Trunck, Théophile (2015), 《Induced minors and well-quasi-ordering》, arXiv:1510.07135, Bibcode:2015arXiv151007135B .

jstor.org

Alon, Seymour & Thomas (1990); Plotkin, Rao & Smith (1994); Reed & Wood (2009). Alon, Noga; Seymour, Paul; Thomas, Robin (1990), “A separator theorem for nonplanar graphs”, 《미국 수학회》 3 (4): 801–808, doi:10.2307/1990903, JSTOR 1990903, MR 1065053 . Plotkin, Serge; Rao, Satish; Smith, Warren D. (1994), 〈Shallow excluded minors and improved graph decompositions〉, 《Proc. 5th ACM–SIAM Symp. on Discrete Algorithms (SODA 1994)》, 462–470쪽 . Reed, Bruce; Wood, David R. (2009), “A linear-time algorithm to find a separator in a graph excluding a minor”, 《ACM Transactions on Algorithms》 5 (4): Article 39, doi:10.1145/1597036.1597043, S2CID 760001 .

lirmm.fr

Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. (2012년 9월 1일). 《Fast Minor Testing in Planar Graphs》 (PDF). 《Algorithmica》 (영어) 64. 69–84쪽. doi:10.1007/s00453-011-9563-9. ISSN 0178-4617. S2CID 6204674.

psu.edu

citeseerx.ist.psu.edu

Johnson, David S. (1987). 《The NP-completeness column: An ongoing guide (edition 19)》. 《Journal of Algorithms》 8. 285–303쪽. CiteSeerX 10.1.1.114.3864. doi:10.1016/0196-6774(87)90043-5.

semanticscholar.org

api.semanticscholar.org

Lovász (2006), p. 77; Wagner (1937a). Lovász, László (2006), “Graph minor theory”, 《미국 수학회》 43 (1): 75–86, doi:10.1090/S0273-0979-05-01088-8 . Wagner, Klaus (1937a), “Über eine Eigenschaft der ebenen Komplexe”, 《Math. Ann.》 114: 570–590, doi:10.1007/BF01594196, S2CID 123534907 .
Fellows & Langston (1988). 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, S2CID 16587284 .
Mader (1967). Mader, Wolfgang (1967), “Homomorphieeigenschaften und mittlere Kantendichte von Graphen”, 《Mathematische Annalen》 174 (4): 265–268, doi:10.1007/BF01364272, S2CID 120261785 .
Kostochka (1982); Kostochka (1984); Thomason (1984); Thomason (2001). Kostochka, Alexandr V. (1982), “The minimum Hadwiger number for graphs with a given mean degree of vertices”, 《Metody Diskret. Analiz.》 (러시아어) 38: 37–58 . Kostochka, Alexandr V. (1984), “Lower bound of the Hadwiger number of graphs by their average degree”, 《Combinatorica》 4 (4): 307–316, doi:10.1007/BF02579141, S2CID 15736799 . Thomason, Andrew (1984), “An extremal function for contractions of graphs”, 《Mathematical Proceedings of the Cambridge Philosophical Society》 95 (2): 261–265, Bibcode:1983MPCPS..95..261T, doi:10.1017/S0305004100061521, S2CID 124801301 . Thomason, Andrew (2001), “The extremal function for complete minors”, 《Journal of Combinatorial Theory, Series B》 81 (2): 318–338, doi:10.1006/jctb.2000.2013 .
Alon, Seymour & Thomas (1990); Plotkin, Rao & Smith (1994); Reed & Wood (2009). Alon, Noga; Seymour, Paul; Thomas, Robin (1990), “A separator theorem for nonplanar graphs”, 《미국 수학회》 3 (4): 801–808, doi:10.2307/1990903, JSTOR 1990903, MR 1065053 . Plotkin, Serge; Rao, Satish; Smith, Warren D. (1994), 〈Shallow excluded minors and improved graph decompositions〉, 《Proc. 5th ACM–SIAM Symp. on Discrete Algorithms (SODA 1994)》, 462–470쪽 . Reed, Bruce; Wood, David R. (2009), “A linear-time algorithm to find a separator in a graph excluding a minor”, 《ACM Transactions on Algorithms》 5 (4): Article 39, doi:10.1145/1597036.1597043, S2CID 760001 .
Grohe (2003) Grohe, Martin (2003), “Local tree-width, excluded minors, and approximation algorithms”, 《Combinatorica》 23 (4): 613–632, arXiv:math/0001128, doi:10.1007/s00493-003-0037-9, S2CID 11751235 .
Robertson, Seymour & Thomas (1993). Robertson, Neil; Seymour, Paul; Thomas, Robin (1993), “Hadwiger's conjecture for K₆-free graphs” (PDF), 《Combinatorica》 13 (3): 279–361, doi:10.1007/BF01202354, S2CID 9608738 .
Eppstein (2000); Demaine & Hajiaghayi (2004). Eppstein, David (2000), “Diameter and treewidth in minor-closed graph families”, 《Algorithmica》 27 (3): 275–291, arXiv:math.CO/9907126, doi:10.1007/s004530010020, MR 1759751, S2CID 3172160 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2004), “Diameter and treewidth in minor-closed graph families, revisited”, 《Algorithmica》 40 (3): 211–215, doi:10.1007/s00453-004-1106-1, S2CID 390856 .
Wagner (1937a); Wagner (1937b); Hall (1943). Wagner, Klaus (1937a), “Über eine Eigenschaft der ebenen Komplexe”, 《Math. Ann.》 114: 570–590, doi:10.1007/BF01594196, S2CID 123534907 . Wagner, Klaus (1937b), “Über eine Erweiterung des Satzes von Kuratowski”, 《Deutsche Mathematik》 2: 280–285 . Hall, Dick Wick (1943), “A note on primitive skew curves”, 《Bulletin of the American Mathematical Society》 49 (12): 935–936, doi:10.1090/S0002-9904-1943-08065-2 .
Kawarabayashi, Ken-ichi; Reed, Bruce; Wollan, Paul (2011), 〈The graph minor algorithm with parity conditions〉, 《52nd Annual IEEE Symposium on Foundations of Computer Science》, Institute of Electrical and Electronics Engineers, 27–36쪽, doi:10.1109/focs.2011.52, S2CID 17385711 .
Chudnovsky, Maria; Kalai, Gil; Nevo, Eran; Novik, Isabella; Seymour, Paul (2016), “Bipartite minors”, 《Journal of Combinatorial Theory》, Series B 116: 219–228, arXiv:1312.0210, doi:10.1016/j.jctb.2015.08.001, MR 3425242, S2CID 14571660 .
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. (2012년 9월 1일). 《Fast Minor Testing in Planar Graphs》 (PDF). 《Algorithmica》 (영어) 64. 69–84쪽. doi:10.1007/s00453-011-9563-9. ISSN 0178-4617. S2CID 6204674.

stanford.edu

Alon, Seymour & Thomas (1990); Plotkin, Rao & Smith (1994); Reed & Wood (2009). Alon, Noga; Seymour, Paul; Thomas, Robin (1990), “A separator theorem for nonplanar graphs”, 《미국 수학회》 3 (4): 801–808, doi:10.2307/1990903, JSTOR 1990903, MR 1065053 . Plotkin, Serge; Rao, Satish; Smith, Warren D. (1994), 〈Shallow excluded minors and improved graph decompositions〉, 《Proc. 5th ACM–SIAM Symp. on Discrete Algorithms (SODA 1994)》, 462–470쪽 . Reed, Bruce; Wood, David R. (2009), “A linear-time algorithm to find a separator in a graph excluding a minor”, 《ACM Transactions on Algorithms》 5 (4): Article 39, doi:10.1145/1597036.1597043, S2CID 760001 .

uni-hamburg.de

math.uni-hamburg.de

Diestel (2005), Chapter 12: Minors, Trees, and WQO; Robertson & Seymour (2004). Diestel, Reinhard (2005), 《Graph Theory》 3판, Berlin, New York: Springer-Verlag, ISBN 978-3-540-26183-4 . Robertson, Neil; Seymour, Paul D. (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 2005, 20쪽 Diestel, Reinhard (2005), 《Graph Theory》 3판, Berlin, New York: Springer-Verlag, ISBN 978-3-540-26183-4 .
Diestel 2005, 22쪽 Diestel, Reinhard (2005), 《Graph Theory》 3판, Berlin, New York: Springer-Verlag, ISBN 978-3-540-26183-4 .

uu.nl

dspace.library.uu.nl

Bodlaender, Hans L. (1993). 《A Tourist Guide through Treewidth》 (PDF). 《Acta Cybernetica》 11. 1–21쪽. Section 5 끝 참조.
Bodlaender, Hans L. (1993). 《A Tourist Guide through Treewidth》 (PDF). 《Acta Cybernetica》 11. 1–21쪽. 정리 5.3 이후 첫 문단

worldcat.org

Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. (2012년 9월 1일). 《Fast Minor Testing in Planar Graphs》 (PDF). 《Algorithmica》 (영어) 64. 69–84쪽. doi:10.1007/s00453-011-9563-9. ISSN 0178-4617. S2CID 6204674.