Grafo cúbico (Portuguese Wikipedia)

Analysis of information sources in references of the Wikipedia article "Grafo cúbico" in Portuguese language version.

refsWebsite

Global rank Portuguese rank

2^nd place

4^th place

2web.archive.org

1^st place

1^st place

low place

low place

26^th place

65^th place

low place

low place

69^th place

195^th place

low place

low place

7,226^th place

9,478^th place

3,645^th place

low place

arxiv.org (Global: 69^th place; Portuguese: 195^th place)

Eppstein, David (2007). «The traveling salesman problem for cubic graphs» (PDF). Journal of Graph Algorithms and Applications. 11 (1). p. 61–81. Arxiv

cuni.cz (Global: 3,645^th place; Portuguese: low place)

kam.mff.cuni.cz

Petr Hliněný (2003). «Crossing Number Is Hard for Cubic Graphs» (PDF). MFCS 2004. pp. 772–782. Consultado em 13 de novembro de 2010. Arquivado do original (PDF) em 21 de fevereiro de 2006

doi.org (Global: 2^nd place; Portuguese: 4^th place)

dx.doi.org

ISAACS, R. (1975). «Infinite families of nontrivial trivalent graphs which are not Tait colorable». American Mathematical Monthly. 82 (3). pp. 221–239. doi:10.2307/2319844 .
Robinson, R.W.; Wormald, N.C. (1994). «Almost all regular graphs are Hamiltonian». Random Structures and Algorithms. 5 (2). p. 363–374. doi:10.1002/rsa.3240050209 .
Fomin, Fedor V.; Høie, Kjartan (2006), «Pathwidth of cubic graphs and exact algorithms», Information Processing Letters, 97 (5): 191–196, doi:10.1016/j.ipl.2005.10.012 .

jgaa.info (Global: low place; Portuguese: low place)

Eppstein, David (2007). «The traveling salesman problem for cubic graphs» (PDF). Journal of Graph Algorithms and Applications. 11 (1). p. 61–81. Arxiv

jstor.org (Global: 26^th place; Portuguese: 65^th place)

ISAACS, R. (1975). «Infinite families of nontrivial trivalent graphs which are not Tait colorable». American Mathematical Monthly. 82 (3). pp. 221–239. doi:10.2307/2319844 .

math.ca (Global: low place; Portuguese: low place)

cms.math.ca

TUTTE, W. T. (1959). «On the symmetry of cubic graphs». Canad. J. Math. 11. pp. 621–624 .

siam.org (Global: low place; Portuguese: low place)

zeno.siam.org

Gebauer, H. (2008). «On the number of Hamilton cycles in bounded degree graphs» (PDF). Proce. 4th Workshop on Analytic Algorithmics and Combinatorics (ANALCO '08) .

uwa.edu.au (Global: 7,226^th place; Portuguese: 9,478^th place)

people.csse.uwa.edu.au

«O censo de Foster». Consultado em 13 de novembro de 2010. Arquivado do original em 4 de outubro de 2008

web.archive.org (Global: 1^st place; Portuguese: 1^st place)

«O censo de Foster». Consultado em 13 de novembro de 2010. Arquivado do original em 4 de outubro de 2008
Petr Hliněný (2003). «Crossing Number Is Hard for Cubic Graphs» (PDF). MFCS 2004. pp. 772–782. Consultado em 13 de novembro de 2010. Arquivado do original (PDF) em 21 de fevereiro de 2006