Egységérmegráf (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Egységérmegráf" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

9doi.org

2^nd place

8^th place

3books.google.com

3^rd place

28^th place

1imfm.si

low place

1lse.ac.uk

2,117^th place

5,457^th place

1arxiv.org

69^th place

778^th place

1epfl.ch

4,521^st place

3,257^th place

1uwm.edu

7,852^nd place

low place

1web.archive.org

1^st place

arxiv.org

Eppstein, D., "Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count", ArXiv e-prints, <https://arxiv.org/pdf/1708.05152.pdf>.

books.google.com

Pisanski, Tomaž & Randić, Milan (2000), "Bridges between geometry and graph theory", in Gorini, Catherine A., Geometry at Work, vol. 53, MAA Notes, Cambridge University Press, pp. 174–194. Lásd főként p. 176.
Brass, Peter; Moser, William & Pach, János (2005), Research Problems in Discrete Geometry, New York: Springer, p. 228, ISBN 978-0387-23815-9, <https://books.google.com/books?id=WehCspo0Qa0C&pg=PA228>.
Hartsfield, Nora & Ringel, Gerhard (2013), "Problem 8.4.8", Pearls in Graph Theory: A Comprehensive Introduction, Dover Books on Mathematics, Courier Corporation, pp. 177–178, ISBN 9780486315522, <https://books.google.com/books?id=VMjDAgAAQBAJ&pg=PA177>.

doi.org

dx.doi.org

Cerioli, Marcia R.; Faria, Luerbio & Ferreira, Talita O. et al. (2011), "A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation", RAIRO Theoretical Informatics and Applications 45 (3): 331–346, DOI 10.1051/ita/2011106.
Csizmadia, G. (1998), "On the independence number of minimum distance graphs", Discrete and Computational Geometry 20 (2): 179–187, DOI 10.1007/PL00009381.
Veltkamp, Remco C. (1994), "2.2.1 Closest pairs", Closed Object Boundaries from Scattered Points, vol. 885, Lecture Notes in Computer Science, Berlin: Springer-Verlag, p. 12, ISBN 3-540-58808-6, DOI 10.1007/3-540-58808-6.
Khuller, Samir & Matias, Yossi (1995), "A simple randomized sieve algorithm for the closest-pair problem", Information and Computation 118 (1): 34–37, DOI 10.1006/inco.1995.1049.
Bowen, Clinton; Durocher, Stephane & Löffler, Maarten et al. (2015), "Realization of simply connected polygonal linkages and recognition of unit disk contact trees", in Giacomo, Emilio Di & Lubiw, Anna, Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24–26, 2015, Revised Selected Papers, vol. 9411, Lecture Notes in Computer Science, Springer, pp. 447–459, DOI 10.1007/978-3-319-27261-0_37.
Pach, János & Agarwal, Pankaj K. (1995), Combinatorial Geometry, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York: John Wiley & Sons, Inc., ISBN 0-471-58890-3, DOI 10.1002/9781118033203. Theorem 13.12, p. 211.
Baker, B. (1994), "Approximation algorithms for NP-complete problems on planar graphs", Journal of the ACM 41 (1): 153–180, DOI 10.1145/174644.174650.
Swanepoel, Konrad J. (2002), "Independence numbers of planar contact graphs", Discrete and Computational Geometry 28 (4): 649–670, DOI 10.1007/s00454-002-2897-y. ami a korábbi, (Csizmadia 1998)-féle $c \geq 9/35 \approx 0,257$ korlát javítása.
Dumitrescu, Adrian & Jiang, Minghui (June 2013), "Computational Geometry Column 56", SIGACT News (New York, NY, USA: ACM) 44 (2): 80–87, doi:10.1145/2491533.2491550, <http://www.cs.uwm.edu/faculty/ad/column56.pdf>. Hozzáférés ideje: 2017-08-30 Archiválva 2014. november 26-i dátummal a Wayback Machine-ben Archivált másolat. [2014. november 26-i dátummal az eredetiből archiválva]. (Hozzáférés: 2017. augusztus 30.).

epfl.ch

infoscience.epfl.ch

Pach, János & Tóth, Géza (1996), "On the independence number of coin graphs", Geombinatorics 6 (1): 30–33, <https://infoscience.epfl.ch/record/129193/files/coincikk.ps>.

imfm.si

preprinti.imfm.si

Pisanski, Tomaž & Randić, Milan (2000), "Bridges between geometry and graph theory", in Gorini, Catherine A., Geometry at Work, vol. 53, MAA Notes, Cambridge University Press, pp. 174–194. Lásd főként p. 176.

lse.ac.uk

personal.lse.ac.uk

Swanepoel, Konrad J. (2009), "Triangle-free minimum distance graphs in the plane", Geombinatorics 19 (1): 28–30, <http://personal.lse.ac.uk/SWANEPOE/swanepoel-min-dist.pdf>.

uwm.edu

cs.uwm.edu

Dumitrescu, Adrian & Jiang, Minghui (June 2013), "Computational Geometry Column 56", SIGACT News (New York, NY, USA: ACM) 44 (2): 80–87, doi:10.1145/2491533.2491550, <http://www.cs.uwm.edu/faculty/ad/column56.pdf>. Hozzáférés ideje: 2017-08-30 Archiválva 2014. november 26-i dátummal a Wayback Machine-ben Archivált másolat. [2014. november 26-i dátummal az eredetiből archiválva]. (Hozzáférés: 2017. augusztus 30.).

web.archive.org

Dumitrescu, Adrian & Jiang, Minghui (June 2013), "Computational Geometry Column 56", SIGACT News (New York, NY, USA: ACM) 44 (2): 80–87, doi:10.1145/2491533.2491550, <http://www.cs.uwm.edu/faculty/ad/column56.pdf>. Hozzáférés ideje: 2017-08-30 Archiválva 2014. november 26-i dátummal a Wayback Machine-ben Archivált másolat. [2014. november 26-i dátummal az eredetiből archiválva]. (Hozzáférés: 2017. augusztus 30.).