Grafo cubico (Italian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Grafo cubico" in Italian language version.

refsWebsite

Global rank Italian rank

11doi.org

2^nd place

7^th place

9oadoi.org

799^th place

22^nd place

2web.archive.org

1^st place

2arxiv.org

69^th place

235^th place

1jstor.org

26^th place

118^th place

1siam.org

low place

arxiv.org

David Eppstein, The traveling salesman problem for cubic graphs (PDF), in Journal of Graph Algorithms and Applications, vol. 11, n. 1, 2007, pp. 61-81, arXiv:cs.DS/0302030. URL consultato il 12 febbraio 2014 (archiviato dall'url originale il 24 febbraio 2021).
Marek Karpinski e Richard Schmied, Approximation Hardness of Graphic TSP on Cubic Graphs, 2013, arXiv:1304.6800.

doi.org

dx.doi.org

R. M. Foster, Geometrical Circuits of Electrical Networks, in Transactions of the American Institute of Electrical Engineers, vol. 51, n. 2, 1932, 309–317, DOI:10.1109/T-AIEE.1932.5056068.
W. T. Tutte, On the symmetry of cubic graphs, in Canad. J. Math, vol. 11, 1959, 621–624, DOI:10.4153/CJM-1959-057-2. URL consultato il 12 febbraio 2014 (archiviato dall'url originale il 16 luglio 2011).
R. Isaacs, Infinite families of nontrivial trivalent graphs which are not Tait colorable, in American Mathematical Monthly, vol. 82, n. 3, 1975, 221–239, DOI:10.2307/2319844, JSTOR 2319844.
M. N. Ellingham e J. D. Horton, Non-Hamiltonian 3-connected cubic bipartite graphs, in Journal of Combinatorial Theory, Series B, vol. 34, n. 3, 1983, pp. 350-353, DOI:10.1016/0095-8956(83)90046-1.
R.W. Robinson e N.C. Wormald, Almost all regular graphs are Hamiltonian, in Random Structures and Algorithms, vol. 5, n. 2, 1994, pp. 363-374, DOI:10.1002/rsa.3240050209.
Fedor V. Fomin e Kjartan Høie, Pathwidth of cubic graphs and exact algorithms, in Information Processing Letters, vol. 97, n. 5, 2006, pp. 191-196, DOI:10.1016/j.ipl.2005.10.012.
Julius Peter Christian Petersen, Die Theorie der regulären Graphs (The theory of regular graphs), in Acta Mathematica, vol. 15, n. 15, 1891, pp. 193-220, DOI:10.1007/BF02392606.
Louis Esperet, František Kardoš, Andrew D. King, Daniel Král e Serguei Norine, Exponentially many perfect matchings in cubic graphs, in Advances in Mathematics, vol. 227, n. 4, 2011, pp. 1646-1664, DOI:10.1016/j.aim.2011.03.015.
Kazuo Iwama e Takuya Nakashima, An Improved Exact Algorithm for Cubic Graph TSP, in Computing and Combinatorics, Lecture Notes in Computer Science, vol. 4598, Springer-Verlag, 2007, pp. 108-117, DOI:10.1007/978-3-540-73545-8_13, ISBN 978-3-540-73544-1.
Paola Alimonti e Viggo Kann, Some APX-completeness results for cubic graphs, in Theoretical Computer Science, vol. 237, 1–2, 2000, pp. 123-134, DOI:10.1016/S0304-3975(98)00158-3.
Petr Hliněný, Crossing number is hard for cubic graphs, in Journal of Combinatorial Theory, Series B, vol. 96, n. 4, 2006, pp. 455-471, DOI:10.1016/j.jctb.2005.09.009.

jstor.org

R. Isaacs, Infinite families of nontrivial trivalent graphs which are not Tait colorable, in American Mathematical Monthly, vol. 82, n. 3, 1975, 221–239, DOI:10.2307/2319844, JSTOR 2319844.

oadoi.org

R. M. Foster, Geometrical Circuits of Electrical Networks, in Transactions of the American Institute of Electrical Engineers, vol. 51, n. 2, 1932, 309–317, DOI:10.1109/T-AIEE.1932.5056068.
R. Isaacs, Infinite families of nontrivial trivalent graphs which are not Tait colorable, in American Mathematical Monthly, vol. 82, n. 3, 1975, 221–239, DOI:10.2307/2319844, JSTOR 2319844.
M. N. Ellingham e J. D. Horton, Non-Hamiltonian 3-connected cubic bipartite graphs, in Journal of Combinatorial Theory, Series B, vol. 34, n. 3, 1983, pp. 350-353, DOI:10.1016/0095-8956(83)90046-1.
R.W. Robinson e N.C. Wormald, Almost all regular graphs are Hamiltonian, in Random Structures and Algorithms, vol. 5, n. 2, 1994, pp. 363-374, DOI:10.1002/rsa.3240050209.
Fedor V. Fomin e Kjartan Høie, Pathwidth of cubic graphs and exact algorithms, in Information Processing Letters, vol. 97, n. 5, 2006, pp. 191-196, DOI:10.1016/j.ipl.2005.10.012.
Julius Peter Christian Petersen, Die Theorie der regulären Graphs (The theory of regular graphs), in Acta Mathematica, vol. 15, n. 15, 1891, pp. 193-220, DOI:10.1007/BF02392606.
Louis Esperet, František Kardoš, Andrew D. King, Daniel Král e Serguei Norine, Exponentially many perfect matchings in cubic graphs, in Advances in Mathematics, vol. 227, n. 4, 2011, pp. 1646-1664, DOI:10.1016/j.aim.2011.03.015.
Paola Alimonti e Viggo Kann, Some APX-completeness results for cubic graphs, in Theoretical Computer Science, vol. 237, 1–2, 2000, pp. 123-134, DOI:10.1016/S0304-3975(98)00158-3.
Petr Hliněný, Crossing number is hard for cubic graphs, in Journal of Combinatorial Theory, Series B, vol. 96, n. 4, 2006, pp. 455-471, DOI:10.1016/j.jctb.2005.09.009.

siam.org

zeno.siam.org

H. Gebauer, On the number of Hamilton cycles in bounded degree graphs (PDF), in Proc. 4th Workshop on Analytic Algorithmics and Combinatorics (ANALCO '08)^{[collegamento interrotto]}, 2008.

web.archive.org

W. T. Tutte, On the symmetry of cubic graphs, in Canad. J. Math, vol. 11, 1959, 621–624, DOI:10.4153/CJM-1959-057-2. URL consultato il 12 febbraio 2014 (archiviato dall'url originale il 16 luglio 2011).
David Eppstein, The traveling salesman problem for cubic graphs (PDF), in Journal of Graph Algorithms and Applications, vol. 11, n. 1, 2007, pp. 61-81, arXiv:cs.DS/0302030. URL consultato il 12 febbraio 2014 (archiviato dall'url originale il 24 febbraio 2021).