Duális gráf (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Duális gráf" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

19books.google.com

3^rd place

28^th place

15doi.org

2^nd place

8^th place

2wolfram.com

513^th place

378^th place

1bme.hu

low place

105^th place

1google.hu

8,839^th place

51^st place

1combinatorics.org

low place

1msri.org

low place

8,566^th place

1handle.net

102^nd place

3,878^th place

1math.ca

low place

1rhul.ac.uk

low place

1plus.google.com

3,615^th place

2,497^th place

bme.hu (Global: low place; Hungarian: 105^th place)

wiki.sch.bme.hu

VIK Wiki

books.google.com (Global: 3^rd place; Hungarian: 28^th place)

Thulasiraman, K. & Swamy, M. N. S. (2011), Graphs: Theory and Algorithms, John Wiley & Sons, Exercise 7.11, p. 198, ISBN 978-1-118-03025-7, <https://books.google.com/books?id=rFH7eQffQNkC&pg=PA198>.
Nishizeki, Takao & Chiba, Norishige (2008), Planar Graphs: Theory and Algorithms, Dover Books on Mathematics, Dover Publications, p. 16, ISBN 978-0-486-46671-2, <https://books.google.com/books?id=1Nl4BpacvpwC&pg=PA16>.
Foulds, L. R. (2012), Graph Theory Applications, Springer, pp. 66–67, ISBN 978-1-4612-0933-1, <https://books.google.com/books?id=5G4QBwAAQBAJ&pg=PA66>.
Bondy, Adrian & Murty, U.S.R. (2008), „Planar Graphs”, Graph Theory, vol. 244, Graduate Texts in Mathematics, Springer, Theorem 10.28, p. 267, ISBN 978-1-84628-969-9, doi:10.1007/978-1-84628-970-5, <https://books.google.com/books?id=HuDFMwZOwcsC&lpg=PA267>
Diestel, Reinhard (2006), Graph Theory, vol. 173, Graduate Texts in Mathematics, Springer, p. 25, ISBN 978-3-540-26183-4, <https://books.google.com/books?id=aR2TMYQr2CMC&pg=PA25>.
Godsil, Chris & Royle, Gordon F. (2013), Algebraic Graph Theory, vol. 207, Graduate Texts in Mathematics, Springer, Theorem 14.3.1, p. 312, ISBN 978-1-4613-0163-9, <https://books.google.com/books?id=GeSPBAAAQBAJ&pg=PA312>.
Oxley, J. G. (2006), Matroid Theory, vol. 3, Oxford Graduate Texts in Mathematics, Oxford University Press, p. 93, ISBN 978-0-19-920250-8, <https://books.google.com/books?id=puKta1Hdz-8C&pg=PA93>.
Lyons, Russell (1998), „A bird's-eye view of uniform spanning trees and forests”, Microsurveys in discrete probability (Princeton, NJ, 1997), vol. 41, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Amer. Math. Soc., Providence, RI, pp. 135–162. See in particular pp. 138–139.
Gross, Jonathan L. & Yellen, Jay, eds. (2003), Handbook of Graph Theory, CRC Press, p. 724, ISBN 978-1-58488-090-5, <https://books.google.com/books?id=mKkIGIea_BkC&lpg=PA724>.
Samet, Hanan (2006), Foundations of Multidimensional and Metric Data Structures, Morgan Kaufmann, p. 348, ISBN 978-0-12-369446-1, <https://books.google.com/books?id=vO-NRRKHG84C&pg=PA348>.
Oxley, J. G. (2006), „5.2 Duality in graphic matroids”, Matroid Theory, vol. 3, Oxford graduate texts in mathematics, Oxford University Press, p. 143, ISBN 978-0-19-920250-8.
Tutte, W. T. (2012), Graph Theory As I Have Known It, vol. 11, Oxford Lecture Series in Mathematics and Its Applications, Oxford University Press, p. 87, ISBN 978-0-19-966055-1, <https://books.google.com/books?id=uYW2tttqQ74C&pg=PA87>.
Chorley, Richard J. & Haggett, Peter (2013), Integrated Models in Geography, Routledge, p. 646, ISBN 978-1-135-12184-6, <https://books.google.com/books?id=8c79AQAAQBAJ&pg=PA646>.
Kandel, Abraham; Bunke, Horst & Last, Mark (2007), Applied Graph Theory in Computer Vision and Pattern Recognition, vol. 52, Studies in Computational Intelligence, Springer, p. 16, ISBN 978-3-540-68020-8, <https://books.google.com/books?id=C8tuCQAAQBAJ&pg=PA16>.
Devadoss, Satyan L. & O'Rourke, Joseph (2011), Discrete and Computational Geometry, Princeton University Press, p. 111, ISBN 978-1-4008-3898-1, <https://books.google.com/books?id=InJL6iAaIQQC&pg=PA111>.
Piguet, Christian (2004), „7.2.1 Static CMOS Logic”, Low-Power Electronics Design, CRC Press, pp. 7-1–7-2, ISBN 978-1-4200-3955-9, <https://books.google.com/books?id=QzKfa_Y4IuIC&pg=SA7-PA1>.
Kaeslin, Hubert (2008), „8.1.4 Composite or complex gates”, Digital Integrated Circuit Design: From VLSI Architectures to CMOS Fabrication, Cambridge University Press, p. 399, ISBN 978-0-521-88267-5, <https://books.google.com/books?id=gdRStcYgf2oC&pg=PA399>.
Richeson, David S. (2012), Euler's Gem: The Polyhedron Formula and the Birth of Topology, Princeton University Press, pp. 58–61, ISBN 978-1-4008-3856-1, <https://books.google.com/books?id=KUYLhOVkaV4C&pg=PA58>.
Biggs, Norman; Lloyd, E. Keith & Wilson, Robin J. (1998), Graph Theory, 1736–1936, Oxford University Press, p. 118, ISBN 978-0-19-853916-2, <https://books.google.com/books?id=XqYTk0sXmpoC&pg=PA118>.

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

Riley, T. R. & Thurston, W. P. (2006), „The absence of efficient dual pairs of spanning trees in planar graphs”, Electronic Journal of Combinatorics 13 (1): Note 13, 7, <http://www.combinatorics.org/Volume_13/Abstracts/v13i1n13.html>.

doi.org (Global: 2^nd place; Hungarian: 8^th place)

dx.doi.org

Servatius, Brigitte & Christopher, Peter R. (1992), „Construction of self-dual graphs”, The American Mathematical Monthly 99 (2): 153–158, DOI 10.2307/2324184.
Bondy, Adrian & Murty, U.S.R. (2008), „Planar Graphs”, Graph Theory, vol. 244, Graduate Texts in Mathematics, Springer, Theorem 10.28, p. 267, ISBN 978-1-84628-969-9, doi:10.1007/978-1-84628-970-5, <https://books.google.com/books?id=HuDFMwZOwcsC&lpg=PA267>
Angelini, Patrizio; Bläsius, Thomas & Rutter, Ignaz (2014), „Testing mutual duality of planar graphs”, International Journal of Computational Geometry and Applications 24 (4): 325–346, DOI 10.1142/S0218195914600103.
Cho, Jung Jin; Chen, Yong & Ding, Yu (2007), „On the (co)girth of a connected matroid”, Discrete Applied Mathematics 155 (18): 2456–2470, DOI 10.1016/j.dam.2007.06.015.
Hartvigsen, D. & Mardon, R. (1994), „The all-pairs min cut problem and the minimum cycle basis problem on planar graphs”, SIAM Journal on Discrete Mathematics 7 (3): 403–418, DOI 10.1137/S0895480190177042.
Noy, Marc (2001), „Acyclic and totally cyclic orientations in planar graphs”, American Mathematical Monthly 108 (1): 66–68, DOI 10.2307/2695680.
He, Xin (1999), „On floor-plan of plane graphs”, SIAM Journal on Computing 28 (6): 2150–2167, DOI 10.1137/s0097539796308874.
Welsh, D. J. A. (1969), „Euler and bipartite matroids”, Journal of Combinatorial Theory 6: 375–377, DOI 10.1016/s0021-9800(69)80033-5.
Florek, Jan (2010), „On Barnette's conjecture”, Discrete Mathematics 310 (10–11): 1531–1535, DOI 10.1016/j.disc.2010.01.018.
Las Vergnas, Michel (1980), „Convexity in oriented matroids”, Journal of Combinatorial Theory, Series B 29 (2): 231–243, DOI 10.1016/0095-8956(80)90082-9.
Sysło, Maciej M. & Proskurowski, Andrzej (1983), „On Halin graphs”, Graph Theory: Proceedings of a Conference held in Lagów, Poland, February 10–13, 1981, vol. 1018, Lecture Notes in Mathematics, Springer-Verlag, pp. 248–256, DOI 10.1007/BFb0071635.
Whitney, Hassler (1932), „Non-separable and planar graphs”, Transactions of the American Mathematical Society 34 (2): 339–362, DOI 10.1090/S0002-9947-1932-1501641-2.
Du, Qiang & Gunzburger, Max (2002), „Grid generation and optimization based on centroidal Voronoi tessellations”, Applied Mathematics and Computation 133 (2–3): 591–607, DOI 10.1016/S0096-3003(01)00260-0.
Rippmann, Matthias (2016), Funicular Shell Design: Geometric Approaches to Form Finding and Fabrication of Discrete Funicular Structures, Habilitation thesis, Diss. ETH No. 23307, ETH Zurich, pp. 39–40, DOI 10.3929/ethz-a-010656780. Lásd még Erickson, Jeff (June 9, 2016), Reciprocal force diagrams from Nouvelle Méchanique ou Statique by Pierre de Varignon (1725), <https://plus.google.com/+JeffErickson/posts/6UyRPX7ShXV>.
Whitney, Hassler (1931), „A theorem on graphs”, Annals of Mathematics, Second Series 32 (2): 378–390, DOI 10.2307/1968197.

google.hu (Global: 8,839^th place; Hungarian: 51^st place)

books.google.hu

Katona Gyula Y – Recski András – Szabó Csaba: A számítástudomány alapjai. 2002–01–01. ISBN 9789639326248 Hozzáférés: 2015. december 20.

handle.net (Global: 102^nd place; Hungarian: 3,878^th place)

hdl.handle.net

Flammini, Alessandro (October 1996), Scaling Behavior for Models of River Network, Ph.D. thesis, International School for Advanced Studies, pp. 40–41, <http://hdl.handle.net/1963/5601>.

math.ca (Global: low place; Hungarian: low place)

cms.math.ca

Tutte, William Thomas (1953). „A contribution to the theory of chromatic polynomials”.

msri.org (Global: low place; Hungarian: 8,566^th place)

Lyons, Russell (1998), „A bird's-eye view of uniform spanning trees and forests”, Microsurveys in discrete probability (Princeton, NJ, 1997), vol. 41, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Amer. Math. Soc., Providence, RI, pp. 135–162. See in particular pp. 138–139.

plus.google.com (Global: 3,615^th place; Hungarian: 2,497^th place)

Rippmann, Matthias (2016), Funicular Shell Design: Geometric Approaches to Form Finding and Fabrication of Discrete Funicular Structures, Habilitation thesis, Diss. ETH No. 23307, ETH Zurich, pp. 39–40, DOI 10.3929/ethz-a-010656780. Lásd még Erickson, Jeff (June 9, 2016), Reciprocal force diagrams from Nouvelle Méchanique ou Statique by Pierre de Varignon (1725), <https://plus.google.com/+JeffErickson/posts/6UyRPX7ShXV>.

rhul.ac.uk (Global: low place; Hungarian: low place)

cs.rhul.ac.uk

Gagarin, Andrei; Kocay, William & Neilson, Daniel (2003), „Embeddings of small graphs on the torus”, Cubo 5: 351–371, <http://www.cs.rhul.ac.uk/home/agagarin/Embeddings.pdf>. Hozzáférés ideje: 2017-04-17.

wolfram.com (Global: 513^th place; Hungarian: 378^th place)

mathworld.wolfram.com

Weisstein, Eric W.: Self-dual graph (angol nyelven). Wolfram MathWorld
Weisstein, Eric W.: Dual Tessellation (angol nyelven). Wolfram MathWorld

Duális gráf (Hungarian Wikipedia)

bme.hu (Global: low place; Hungarian: 105th place)

wiki.sch.bme.hu

books.google.com (Global: 3rd place; Hungarian: 28th place)

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

doi.org (Global: 2nd place; Hungarian: 8th place)

dx.doi.org

google.hu (Global: 8,839th place; Hungarian: 51st place)

books.google.hu

handle.net (Global: 102nd place; Hungarian: 3,878th place)

hdl.handle.net

math.ca (Global: low place; Hungarian: low place)

cms.math.ca

msri.org (Global: low place; Hungarian: 8,566th place)

plus.google.com (Global: 3,615th place; Hungarian: 2,497th place)

rhul.ac.uk (Global: low place; Hungarian: low place)

cs.rhul.ac.uk

wolfram.com (Global: 513th place; Hungarian: 378th place)

mathworld.wolfram.com

bme.hu (Global: low place; Hungarian: 105^th place)

books.google.com (Global: 3^rd place; Hungarian: 28^th place)

doi.org (Global: 2^nd place; Hungarian: 8^th place)

google.hu (Global: 8,839^th place; Hungarian: 51^st place)

handle.net (Global: 102^nd place; Hungarian: 3,878^th place)

msri.org (Global: low place; Hungarian: 8,566^th place)

plus.google.com (Global: 3,615^th place; Hungarian: 2,497^th place)

wolfram.com (Global: 513^th place; Hungarian: 378^th place)