Snark (teoria dei grafi) (Italian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Snark (teoria dei grafi)" in Italian language version.

refsWebsite

Global rank Italian rank

2^nd place

7^th place

799^th place

22^nd place

451^st place

2,019^th place

26^th place

118^th place

1^st place

3,413^th place

4,150^th place

69^th place

235^th place

ams.org

E. Steffen, Classification and characterizations of snarks, in Discrete Mathematics, vol. 188, n. 1-3, 1998, 183-203, DOI:10.1016/S0012-365X(97)00255-0, MR 1630478.
E. Steffen, On bicritical snarks, in Math. Slovaca, vol. 51, n. 2, 2001, 141-150, MR 1841443.
sarah-marie belcastro, The continuing saga of snarks, in The College Mathematics Journal, vol. 43, n. 1, 2012, 82-87, DOI:10.4169/college.math.j.43.1.082, MR 2875562..

Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund and Klas Markström, Generation and Properties of Snarks, 2012.

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

Szekeres, G., Polyhedral decompositions of cubic graphs, in Bull. Austral. Math. Soc., vol. 8, n. 3, 1973, 367-387, DOI:10.1017/S0004972700042660.
R. Isaacs, Infinite families of non-trivial trivalent graphs which are not Tait-colorable, in American Mathematical Monthly, vol. 82, n. 3, 1975, 221-239, DOI:10.2307/2319844, JSTOR 2319844.
E. Steffen, Classification and characterizations of snarks, in Discrete Mathematics, vol. 188, n. 1-3, 1998, 183-203, DOI:10.1016/S0012-365X(97)00255-0, MR 1630478.
Z. Skupień, Exponentially many hypohamiltonian snarks, in 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Electronic Notes in Discrete Mathematics, vol. 28, 2007, 417-424, DOI:10.1016/j.endm.2007.01.059.
sarah-marie belcastro, The continuing saga of snarks, in The College Mathematics Journal, vol. 43, n. 1, 2012, 82-87, DOI:10.4169/college.math.j.43.1.082, MR 2875562..

Robin Thomas, Recent Excluded Minor Theorems for Graphs (PDF), in Surveys in Combinatorics, 1999, Cambridge University Press, 1999, pp. 201-222. URL consultato il 20 febbraio 2014 (archiviato dall'url originale il 3 agosto 2016).