Általánosított Petersen-gráf (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Általánosított Petersen-gráf" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

9doi.org

2^nd place

8^th place

2worldcat.org

5^th place

22^nd place

1imfm.si

low place

1web.archive.org

1^st place

1txstate.edu

7,869^th place

low place

doi.org

dx.doi.org

Coxeter, H. S. M. (1950), "Self-dual configurations and regular graphs", Bulletin of the American Mathematical Society 56: 413–455, DOI 10.1090/S0002-9904-1950-09407-5.
Watkins, Mark E. (1969), "A Theorem on Tait Colorings with an Application to the Generalized Petersen Graphs", Journal of Combinatorial Theory 6: 152–164, DOI 10.1016/S0021-9800(69)80116-X.
Frucht, R.; Graver, J. E. & Watkins, M. E. (1971), "The groups of the generalized Petersen graphs", Proceedings of the Cambridge Philosophical Society 70: 211–218, DOI 10.1017/S0305004100049811.
Alspach, B. R. (1983), "The classification of Hamiltonian generalized Petersen graphs", Journal of Combinatorial Theory, Series B 34: 293–312, DOI 10.1016/0095-8956(83)90042-4.
Thomason, Andrew (1982), "Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable", Journal of Graph Theory 6 (2): 219–221, DOI 10.1002/jgt.3190060218.
Schwenk, Allen J. (1989), "Enumeration of Hamiltonian cycles in certain generalized Petersen graphs", Journal of Combinatorial Theory, Series B 47 (1): 53–59, DOI 10.1016/0095-8956(89)90064-6.
Ferrero, Daniela & Hanusch, Sarah (2014), "Component connectivity of generalized Petersen graphs", International Journal of Computer Mathematics 91 (9): 1940–1963, ISSN 0020-7160, doi:10.1080/00207160.2013.878023, <http://danielaferrero.wp.txstate.edu/files/2015/03/Component-connectivity-generalized-Petersen-graphs.pdf>. Hozzáférés ideje: 2018-10-20
Castagna, Frank & Prins, Geert Caleb Ernst (1972), "Every generalized Petersen graph has a Tait coloring", Pacific Journal of Mathematics 40, ISSN 0030-8730, DOI 10.2140/pjm.1972.40.53
Boben, Marko; Pisanski, Tomaž & Žitnik, Arjana (2005), "I-graphs and the corresponding configurations", Journal of Combinatorial Designs 13 (6): 406–424, DOI 10.1002/jcd.20054.

imfm.si

preprinti.imfm.si

Žitnik, Arjana; Horvat, Boris & Pisanski, Tomaž (2010), All generalized Petersen graphs are unit-distance graphs, vol. 1109, IMFM preprints, <http://preprinti.imfm.si/PDF/01109.pdf> Archiválva 2018. július 24-i dátummal a Wayback Machine-ben Archivált másolat. [2018. július 24-i dátummal az eredetiből archiválva]. (Hozzáférés: 2018. október 19.).

txstate.edu

danielaferrero.wp.txstate.edu

Ferrero, Daniela & Hanusch, Sarah (2014), "Component connectivity of generalized Petersen graphs", International Journal of Computer Mathematics 91 (9): 1940–1963, ISSN 0020-7160, doi:10.1080/00207160.2013.878023, <http://danielaferrero.wp.txstate.edu/files/2015/03/Component-connectivity-generalized-Petersen-graphs.pdf>. Hozzáférés ideje: 2018-10-20

web.archive.org

Žitnik, Arjana; Horvat, Boris & Pisanski, Tomaž (2010), All generalized Petersen graphs are unit-distance graphs, vol. 1109, IMFM preprints, <http://preprinti.imfm.si/PDF/01109.pdf> Archiválva 2018. július 24-i dátummal a Wayback Machine-ben Archivált másolat. [2018. július 24-i dátummal az eredetiből archiválva]. (Hozzáférés: 2018. október 19.).

worldcat.org

Ferrero, Daniela & Hanusch, Sarah (2014), "Component connectivity of generalized Petersen graphs", International Journal of Computer Mathematics 91 (9): 1940–1963, ISSN 0020-7160, doi:10.1080/00207160.2013.878023, <http://danielaferrero.wp.txstate.edu/files/2015/03/Component-connectivity-generalized-Petersen-graphs.pdf>. Hozzáférés ideje: 2018-10-20
Castagna, Frank & Prins, Geert Caleb Ernst (1972), "Every generalized Petersen graph has a Tait coloring", Pacific Journal of Mathematics 40, ISSN 0030-8730, DOI 10.2140/pjm.1972.40.53