그래프 그리기 (Korean Wikipedia)

Analysis of information sources in references of the Wikipedia article "그래프 그리기" in Korean language version.

refsWebsite

Global rank Korean rank

7doi.org

2^nd place

3^rd place

5ams.org

451^st place

121^st place

5worldcat.org

5^th place

11^th place

5zbmath.org

1,923^rd place

99^th place

3icm.edu.pl

2,656^th place

2,699^th place

2archive.org

6^th place

18^th place

1combinatorics.org

low place

1arxiv.org

69^th place

54^th place

1harvard.edu

18^th place

27^th place

1mit.edu

415^th place

263^rd place

ams.org (Global: 451^st place; Korean: 121^st place)

Kleitman, Daniel J. (1970). “The crossing number of K_5,n” (영어). 《Journal of Combinatorial Theory》 9: 315–323. doi:10.1016/s0021-9800(70)80087-4. MR 0280403.
Woodall, D. R. (1993년 12월). “Cyclic-order graphs and Zarankiewicz's crossing-number conjecture” (영어). 《Journal of Graph Theory》 17 (6): 657–671. doi:10.1002/jgt.3190170602. ISSN 0364-9024. MR 1244681.
Tutte, William Thomas (1970). “Toward a theory of crossing numbers” (영어). 《Journal of Combinatorial Theory》 8: 45–53. doi:10.1016/s0021-9800(70)80007-2. MR 0262110. Zbl 0187.20803.
Zarankiewicz, Kazimierz (1954). “On a problem of P. Turan concerning graphs” (영어). 《Fundamenta Mathematicae》 41: 137–145. ISSN 0016-2736. MR 63641. Zbl 0055.41605.
Ajtai, Miklós; Chvátal, Václav; Newborn, Monroe Monty; Szemerédi, Endre (1982). 〈Crossing-free subgraphs〉 (영어). Rosa, Alexander; Sabidussi, Gert; Turgeon, Jean (편집). 《Theory and practice of combinatorics. A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday》. Annals of Discrete Mathematics 12. North-Holland. 9–12쪽. doi:10.1016/S0304-0208(08)73484-4. ISBN 978-0-444-86318-8. MR 806962. Zbl 0502.05021.

archive.org (Global: 6^th place; Korean: 18^th place)

Woodall, D. R. (1993년 12월). “Cyclic-order graphs and Zarankiewicz's crossing-number conjecture” (영어). 《Journal of Graph Theory》 17 (6): 657–671. doi:10.1002/jgt.3190170602. ISSN 0364-9024. MR 1244681.
Turán, Pál (1977). “A note of welcome” (영어). 《Journal of Graph Theory》 1: 7–9. doi:10.1002/jgt.3190010105.

arxiv.org (Global: 69^th place; Korean: 54^th place)

Ackerman, Eyal (2013). “On topological graphs with at most four crossings per edge” (영어). arXiv:1509.01932. Bibcode:2015arXiv150901932A.

combinatorics.org (Global: low place; Korean: low place)

Schaefer, Marcus (2014년 5월 15일). “The graph crossing number and its variants: a survey” (영어). 《The Electronic Journal of Combinatorics》 DS: 21.

doi.org (Global: 2^nd place; Korean: 3^rd place)

dx.doi.org

Kleitman, Daniel J. (1970). “The crossing number of K_5,n” (영어). 《Journal of Combinatorial Theory》 9: 315–323. doi:10.1016/s0021-9800(70)80087-4. MR 0280403.
Woodall, D. R. (1993년 12월). “Cyclic-order graphs and Zarankiewicz's crossing-number conjecture” (영어). 《Journal of Graph Theory》 17 (6): 657–671. doi:10.1002/jgt.3190170602. ISSN 0364-9024. MR 1244681.
Tutte, William Thomas (1970). “Toward a theory of crossing numbers” (영어). 《Journal of Combinatorial Theory》 8: 45–53. doi:10.1016/s0021-9800(70)80007-2. MR 0262110. Zbl 0187.20803.
Beineke, Lowell; Wilson, Robin (2010년 6월). “The early history of the brick factory problem” (영어). 《The Mathematical Intelligencer》 32 (2): 41–48. doi:10.1007/s00283-009-9120-4.
Székely, László A. (2016). 〈Turán’s brick factory problem: the status of the conjectures of Zarankiewicz and Hill〉 (영어). Gera, Ralucca; Hedetniemi, Stephen; Larson, Craig (편집). 《Graph theory: favorite conjectures and open problems 1》. Problem Books in Mathematics. 211–230쪽. doi:10.1007/978-3-319-31940-7_13. ISBN 978-3-319-31938-4. ISSN 0941-3502.
Turán, Pál (1977). “A note of welcome” (영어). 《Journal of Graph Theory》 1: 7–9. doi:10.1002/jgt.3190010105.
Ajtai, Miklós; Chvátal, Václav; Newborn, Monroe Monty; Szemerédi, Endre (1982). 〈Crossing-free subgraphs〉 (영어). Rosa, Alexander; Sabidussi, Gert; Turgeon, Jean (편집). 《Theory and practice of combinatorics. A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday》. Annals of Discrete Mathematics 12. North-Holland. 9–12쪽. doi:10.1016/S0304-0208(08)73484-4. ISBN 978-0-444-86318-8. MR 806962. Zbl 0502.05021.

harvard.edu (Global: 18^th place; Korean: 27^th place)

adsabs.harvard.edu

Ackerman, Eyal (2013). “On topological graphs with at most four crossings per edge” (영어). arXiv:1509.01932. Bibcode:2015arXiv150901932A.

icm.edu.pl (Global: 2,656^th place; Korean: 2,699^th place)

pldml.icm.edu.pl

Chojnacki, Chaim (1934). “Über wesentlich unplättbare Kurven im dreidimensionalen Raume” (독일어). 《Fundamenta Mathematicae》 23 (1): 135–142. ISSN 0016-2736. JFM 60.0528.02. Zbl 0009.41104.
Zarankiewicz, Kazimierz (1954). “On a problem of P. Turan concerning graphs” (영어). 《Fundamenta Mathematicae》 41: 137–145. ISSN 0016-2736. MR 63641. Zbl 0055.41605.

matwbn.icm.edu.pl

Urbanik, Kazimierz (1953년 1월 2일). “Solution du problème posé par P. Turán” (PDF) (프랑스어). 《Colloquium Mathematicum》 3: 200–201. ISSN 0010-1354.

mit.edu (Global: 415^th place; Korean: 263^rd place)

mitpress.mit.edu

Leighton, Frank Thomson (1983). 《Complexity issues in VLSI. Optimal layouts for the shuffle-exchange graph and other networks》 (영어). Foundations of Computing Series. Massachusetts Institute of Technology Press. ISBN 978-0-262-62178-6.

worldcat.org (Global: 5^th place; Korean: 11^th place)

Woodall, D. R. (1993년 12월). “Cyclic-order graphs and Zarankiewicz's crossing-number conjecture” (영어). 《Journal of Graph Theory》 17 (6): 657–671. doi:10.1002/jgt.3190170602. ISSN 0364-9024. MR 1244681.
Chojnacki, Chaim (1934). “Über wesentlich unplättbare Kurven im dreidimensionalen Raume” (독일어). 《Fundamenta Mathematicae》 23 (1): 135–142. ISSN 0016-2736. JFM 60.0528.02. Zbl 0009.41104.
Székely, László A. (2016). 〈Turán’s brick factory problem: the status of the conjectures of Zarankiewicz and Hill〉 (영어). Gera, Ralucca; Hedetniemi, Stephen; Larson, Craig (편집). 《Graph theory: favorite conjectures and open problems 1》. Problem Books in Mathematics. 211–230쪽. doi:10.1007/978-3-319-31940-7_13. ISBN 978-3-319-31938-4. ISSN 0941-3502.
Zarankiewicz, Kazimierz (1954). “On a problem of P. Turan concerning graphs” (영어). 《Fundamenta Mathematicae》 41: 137–145. ISSN 0016-2736. MR 63641. Zbl 0055.41605.
Urbanik, Kazimierz (1953년 1월 2일). “Solution du problème posé par P. Turán” (PDF) (프랑스어). 《Colloquium Mathematicum》 3: 200–201. ISSN 0010-1354.

zbmath.org (Global: 1,923^rd place; Korean: 99^th place)

Chojnacki, Chaim (1934). “Über wesentlich unplättbare Kurven im dreidimensionalen Raume” (독일어). 《Fundamenta Mathematicae》 23 (1): 135–142. ISSN 0016-2736. JFM 60.0528.02. Zbl 0009.41104.
Tutte, William Thomas (1970). “Toward a theory of crossing numbers” (영어). 《Journal of Combinatorial Theory》 8: 45–53. doi:10.1016/s0021-9800(70)80007-2. MR 0262110. Zbl 0187.20803.
Zarankiewicz, Kazimierz (1954). “On a problem of P. Turan concerning graphs” (영어). 《Fundamenta Mathematicae》 41: 137–145. ISSN 0016-2736. MR 63641. Zbl 0055.41605.
Guy, Richard Kenneth (1969). 〈The decline and fall of Zarankiewicz’s theorem〉 (영어). Harary, Frank (편집). 《Proof techniques in graph theory. Proceedings of the Second Ann Arbor Graph Theory Conference 1968》. Academic Press. 63–69쪽. ISBN 978-012324260-0. Zbl 0192.60601.
Ajtai, Miklós; Chvátal, Václav; Newborn, Monroe Monty; Szemerédi, Endre (1982). 〈Crossing-free subgraphs〉 (영어). Rosa, Alexander; Sabidussi, Gert; Turgeon, Jean (편집). 《Theory and practice of combinatorics. A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday》. Annals of Discrete Mathematics 12. North-Holland. 9–12쪽. doi:10.1016/S0304-0208(08)73484-4. ISBN 978-0-444-86318-8. MR 806962. Zbl 0502.05021.

그래프 그리기 (Korean Wikipedia)

ams.org (Global: 451st place; Korean: 121st place)

archive.org (Global: 6th place; Korean: 18th place)

arxiv.org (Global: 69th place; Korean: 54th place)