Periferikus kör (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Periferikus kör" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

9doi.org

2^nd place

8^th place

doi.org

dx.doi.org

Tutte, W. T. (1963), "How to draw a graph", Proceedings of the London Mathematical Society, Third Series 13: 743–767, DOI 10.1112/plms/s3-13.1.743.
Tutte, W. T. (1960), "Convex representations of graphs", Proceedings of the London Mathematical Society, Third Series 10: 304–320, DOI 10.1112/plms/s3-10.1.304.
Lásd a Theorem 2.8-at követő megjegyzéseket itt: (Tutte 1963). Tutte megfigyelése szerint ez a tény már számukra is ismert volt: Whitney, Hassler (1932), "Non-separable and planar graphs", Transactions of the American Mathematical Society 34 (2): 339–362, DOI 10.2307/1989545.
Bruhn, Henning (2004), "The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits", Journal of Combinatorial Theory, Series B 92 (2): 235–256, DOI 10.1016/j.jctb.2004.03.005.
Thomassen, Carsten & Toft, Bjarne (1981), "Non-separating induced cycles in graphs", Journal of Combinatorial Theory, Series B 31 (2): 199–224, DOI 10.1016/S0095-8956(81)80025-1.
Schmidt, Jens M. (2014), The Mondshein Sequence, pp. 967-978, DOI 10.1007/978-3-662-43948-7_80.
Seymour, P. D. & Weaver, R. W. (1984), "A generalization of chordal graphs", Journal of Graph Theory 8 (2): 241–251, DOI 10.1002/jgt.3190080206.
Lásd pl. Cabello, Sergio & Mohar, Bojan (2007), "Finding shortest non-separating and non-contractible cycles for topologically embedded graphs", Discrete and Computational Geometry 37 (2): 213–235, DOI 10.1007/s00454-006-1292-5.
Maia, Bráulio, Junior; Lemos, Manoel & Melo, Tereza R. B. (2007), "Non-separating circuits and cocircuits in matroids", Combinatorics, complexity, and chance, vol. 34, Oxford Lecture Ser. Math. Appl., Oxford: Oxford Univ. Press, pp. 162–171, DOI 10.1093/acprof:oso/9780198571278.003.0010.