Снарк (теорія графів) (Ukrainian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Снарк (теорія графів)" in Ukrainian language version.

refsWebsite

Global rank Ukrainian rank

2^nd place

4^th place

26^th place

129^th place

742^nd place

3,123^rd place

3,413^th place

6,452^nd place

1^st place

doi.org

G. Szekeres. Polyhedral decompositions of cubic graphs // Bull. Austral. Math. Soc.. — 1973. — Т. 8, вип. 3. — С. 367–387. — doi:10.1017/S0004972700042660.
R. Isaacs. Infinite families of non-trivial trivalent graphs which are not Tait-colorable // American Mathematical Monthly. — 1975. — Т. 82, вип. 3. — С. 221–239. — doi:10.2307/2319844. — JSTOR 2319844.
Steffen E. Classification and characterizations of snarks // Discrete Mathematics. — 1998. — Т. 188, вип. 1–3. — С. 183–203. — doi:10.1016/S0012-365X(97)00255-0.
Z. Skupień. 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications. — Electronic Notes in Discrete Mathematics. — 2007. — Т. 28. — С. 417–424. — doi:10.1016/j.endm.2007.01.059.
F. Jaeger. Annals of Discrete Mathematics 27 – Cycles in Graphs. — 1985. — Т. 27. — С. 1–12. — (North-Holland Mathematics Studies). — ISBN 978-0-444-87803-8. — doi:10.1016/S0304-0208(08)72993-1.
Sarah-Marie Belcastro. The continuing saga of snarks // The College Mathematics Journal. — 2012. — Т. 43, вип. 1. — С. 82–87. — doi:10.4169/college.math.j.43.1.082.

R. Isaacs. Infinite families of non-trivial trivalent graphs which are not Tait-colorable // American Mathematical Monthly. — 1975. — Т. 82, вип. 3. — С. 221–239. — doi:10.2307/2319844. — JSTOR 2319844.