Metszési szám (gráfelmélet) (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Metszési szám (gráfelmélet)" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

9doi.org

2^nd place

8^th place

7ams.org

451^st place

1,456^th place

3archive.org

6^th place

14^th place

2web.archive.org

1^st place

1mtak.hu

low place

124^th place

1uvt.nl

low place

1arxiv.org

69^th place

778^th place

1jstor.org

26^th place

330^th place

1tugraz.at

low place

1wolfram.com

513^th place

378^th place

1indstate.edu

low place

1haifa.ac.il

low place

9,195^th place

ams.org

Garey, M. R.; Johnson, D. S. (1983). „Crossing number is NP-complete”. SIAM J. Alg. Discr. Meth. 4, 312–316. o. DOI:10.1137/0604033. MathSciNet:0711340.
Hliněný, P. (2006). „Crossing number is hard for cubic graphs”. Journal of Combinatorial Theory, Series B 96 (4), 455–471. o. DOI:10.1016/j.jctb.2005.09.009. MathSciNet:2232384.
Grohe, M. (2005). „Computing crossing numbers in quadratic time”. J. Comput. System Sci. 68 (2), 285–302. o. DOI:10.1016/j.jcss.2003.07.008. MathSciNet:2059096. ; (2007) „Proceedings of the 29th Annual ACM Symposium on Theory of Computing”, 382–390. o. DOI:10.1145/1250790.1250848.
Ajtai, M.; Chvátal, V.; Newborn, M.; Szemerédi, E. (1982). „Crossing-free subgraphs”. Theory and Practice of Combinatorics 60: 9–12. MathSciNet:0806962.
Pach, J.; Tóth, G. (1997). „Graphs drawn with few crossings per edge”. Combinatorica 17, 427–439. o. DOI:10.1007/BF01215922. MathSciNet:1606052.
Székely, L. A. (1997). „Crossing numbers and hard Erdős problems in discrete geometry”. Combinatorics, Probability and Computing 6, 353–358. o. DOI:10.1017/S0963548397002976. MathSciNet:1464571.
Dey, T. L. (1998). „Improved bounds for planar k-sets and related problems”. Discrete and Computational Geometry 19 (3), 373–382. o. DOI:10.1007/PL00009354. MathSciNet:1608878.

archive.org

Turán, P. (1977). „A Note of Welcome”. J. Graph Theory 1, 7–9. o. DOI:10.1002/jgt.3190010105.
(2009) „Towards the Albertson Conjecture”. arXiv:0909.0413.
Pach, J.; Tóth, G. (1997). „Graphs drawn with few crossings per edge”. Combinatorica 17, 427–439. o. DOI:10.1007/BF01215922. MathSciNet:1606052.

arxiv.org

(2009) „Towards the Albertson Conjecture”. arXiv:0909.0413.

doi.org

dx.doi.org

Turán, P. (1977). „A Note of Welcome”. J. Graph Theory 1, 7–9. o. DOI:10.1002/jgt.3190010105.
(1994) „The rectilinear crossing number of a complete graph and Sylvester's "four point problem" of geometric probability”. American Mathematical Monthly 101 (10), 939–943. o. DOI:10.2307/2975158.
Garey, M. R.; Johnson, D. S. (1983). „Crossing number is NP-complete”. SIAM J. Alg. Discr. Meth. 4, 312–316. o. DOI:10.1137/0604033. MathSciNet:0711340.
Hliněný, P. (2006). „Crossing number is hard for cubic graphs”. Journal of Combinatorial Theory, Series B 96 (4), 455–471. o. DOI:10.1016/j.jctb.2005.09.009. MathSciNet:2232384.
Grohe, M. (2005). „Computing crossing numbers in quadratic time”. J. Comput. System Sci. 68 (2), 285–302. o. DOI:10.1016/j.jcss.2003.07.008. MathSciNet:2059096. ; (2007) „Proceedings of the 29th Annual ACM Symposium on Theory of Computing”, 382–390. o. DOI:10.1145/1250790.1250848.
(2003) „Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas”. SIAM J. Comput 32 (1), 231–252. o. DOI:10.1137/S0097539700373520.
Pach, J.; Tóth, G. (1997). „Graphs drawn with few crossings per edge”. Combinatorica 17, 427–439. o. DOI:10.1007/BF01215922. MathSciNet:1606052.
Székely, L. A. (1997). „Crossing numbers and hard Erdős problems in discrete geometry”. Combinatorics, Probability and Computing 6, 353–358. o. DOI:10.1017/S0963548397002976. MathSciNet:1464571.
Dey, T. L. (1998). „Improved bounds for planar k-sets and related problems”. Discrete and Computational Geometry 19 (3), 373–382. o. DOI:10.1007/PL00009354. MathSciNet:1608878.

haifa.ac.il

sci.haifa.ac.il

Ackerman, Eyal: On topological graphs with at most four crossings per edge, 2013. [2014. július 14-i dátummal az eredetiből archiválva].

indstate.edu

isu.indstate.edu

Exoo, G. "Rectilinear Drawings of Famous Graphs".

jstor.org

(1994) „The rectilinear crossing number of a complete graph and Sylvester's "four point problem" of geometric probability”. American Mathematical Monthly 101 (10), 939–943. o. DOI:10.2307/2975158.

mtak.hu

real-d.mtak.hu

Tóth Géza: Gráfok metszési számai és a k-halmaz probléma. Doktori disszertáció PDF

tugraz.at

dist.ist.tugraz.at

Rectilinear Crossing Number on the Institute for Software Technology at Graz, University of Technology (2009).

uvt.nl

arno.uvt.nl

Klerk, E. de, Maharry, J., Pasechnik, D.V., Richter, B., & Salazar, G. (2006). Improved bounds for the crossing numbers of K_m,n and K_n. Archiválva 2011. július 18-i dátummal a Wayback Machine-ben SIAM Journal on Discrete Mathematics 20(1), 189-202, 2006

web.archive.org

Klerk, E. de, Maharry, J., Pasechnik, D.V., Richter, B., & Salazar, G. (2006). Improved bounds for the crossing numbers of K_m,n and K_n. Archiválva 2011. július 18-i dátummal a Wayback Machine-ben SIAM Journal on Discrete Mathematics 20(1), 189-202, 2006
Ackerman, Eyal: On topological graphs with at most four crossings per edge, 2013. [2014. július 14-i dátummal az eredetiből archiválva].

wolfram.com

mathworld.wolfram.com

Weisstein, Eric W.: Graph Crossing Number (angol nyelven). Wolfram MathWorld