Cubic graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Cubic graph" in English language version.

refsWebsite

Global rank English rank

15doi.org

2^nd place

6semanticscholar.org

11^th place

8^th place

5arxiv.org

69^th place

59^th place

2harvard.edu

18^th place

17^th place

1web.archive.org

1^st place

1math.ca

low place

1tue.nl

9,054^th place

6,363^rd place

1worldcat.org

5^th place

1ams.org

451^st place

277^th place

1jstor.org

26^th place

20^th place

1jgaa.info

low place

1siam.org

low place

6,473^rd place

1zenodo.org

621^st place

380^th place

ams.org

mathscinet.ams.org

Frucht, R. (1949), "Graphs of degree three with a given abstract group", Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, S2CID 124723321.

arxiv.org

Eppstein, David (2007), "The traveling salesman problem for cubic graphs" (PDF), Journal of Graph Algorithms and Applications, 11 (1): 61–81, arXiv:cs.DS/0302030, doi:10.7155/jgaa.00137.
Esperet, Louis; Kardoš, František; King, Andrew D.; Kráľ, Daniel; Norine, Serguei (2011), "Exponentially many perfect matchings in cubic graphs", Advances in Mathematics, 227 (4): 1646–1664, arXiv:1012.2878, doi:10.1016/j.aim.2011.03.015, S2CID 4401537.
Xiao, Mingyu; Nagamochi, Hiroshi (2013), "An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure", Theory and Applications of Models of Computation, Lecture Notes in Computer Science, vol. 7876, Springer-Verlag, pp. 96–107, arXiv:1212.6831, doi:10.1007/978-3-642-38236-9_10, ISBN 978-3-642-38236-9.
Xiao, Mingyu; Nagamochi, Hiroshi (2012), "An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure", Algorithmica, 74 (2): 713–741, arXiv:1212.6831, Bibcode:2012arXiv1212.6831X, doi:10.1007/s00453-015-9970-4, S2CID 7654681.
Karpinski, Marek; Schmied, Richard (2013), Approximation Hardness of Graphic TSP on Cubic Graphs, arXiv:1304.6800, Bibcode:2013arXiv1304.6800K.

doi.org

Foster, R. M. (1932), "Geometrical Circuits of Electrical Networks", Transactions of the American Institute of Electrical Engineers, 51 (2): 309–317, doi:10.1109/T-AIEE.1932.5056068, S2CID 51638449.
Tutte, W. T. (1959), "On the symmetry of cubic graphs", Can. J. Math., 11: 621–624, doi:10.4153/CJM-1959-057-2, S2CID 124273238, archived from the original on 2011-07-16, retrieved 2010-07-21.
Frucht, R. (1949), "Graphs of degree three with a given abstract group", Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, S2CID 124723321.
Isaacs, R. (1975), "Infinite families of nontrivial trivalent graphs which are not Tait colorable", American Mathematical Monthly, 82 (3): 221–239, doi:10.2307/2319844, JSTOR 2319844.
Ellingham, M. N.; Horton, J. D. (1983), "Non-Hamiltonian 3-connected cubic bipartite graphs", Journal of Combinatorial Theory, Series B, 34 (3): 350–353, doi:10.1016/0095-8956(83)90046-1.
Robinson, R.W.; Wormald, N.C. (1994), "Almost all regular graphs are Hamiltonian", Random Structures and Algorithms, 5 (2): 363–374, doi:10.1002/rsa.3240050209.
Eppstein, David (2007), "The traveling salesman problem for cubic graphs" (PDF), Journal of Graph Algorithms and Applications, 11 (1): 61–81, arXiv:cs.DS/0302030, doi:10.7155/jgaa.00137.
Gebauer, H. (2008), "On the number of Hamilton cycles in bounded degree graphs", Proc. 4th Workshop on Analytic Algorithmics and Combinatorics (ANALCO '08), pp. 241–248, doi:10.1137/1.9781611972986.8, ISBN 9781611972986.
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.
Petersen, Julius Peter Christian (1891), "Die Theorie der regulären Graphs (The theory of regular graphs)", Acta Mathematica, 15 (15): 193–220, doi:10.1007/BF02392606, S2CID 123779343.
Esperet, Louis; Kardoš, František; King, Andrew D.; Kráľ, Daniel; Norine, Serguei (2011), "Exponentially many perfect matchings in cubic graphs", Advances in Mathematics, 227 (4): 1646–1664, arXiv:1012.2878, doi:10.1016/j.aim.2011.03.015, S2CID 4401537.
Xiao, Mingyu; Nagamochi, Hiroshi (2013), "An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure", Theory and Applications of Models of Computation, Lecture Notes in Computer Science, vol. 7876, Springer-Verlag, pp. 96–107, arXiv:1212.6831, doi:10.1007/978-3-642-38236-9_10, ISBN 978-3-642-38236-9.
Xiao, Mingyu; Nagamochi, Hiroshi (2012), "An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure", Algorithmica, 74 (2): 713–741, arXiv:1212.6831, Bibcode:2012arXiv1212.6831X, doi:10.1007/s00453-015-9970-4, S2CID 7654681.
Alimonti, Paola; Kann, Viggo (2000), "Some APX-completeness results for cubic graphs", Theoretical Computer Science, 237 (1–2): 123–134, doi:10.1016/S0304-3975(98)00158-3.
Hliněný, Petr (2006), "Crossing number is hard for cubic graphs", Journal of Combinatorial Theory, Series B, 96 (4): 455–471, doi:10.1016/j.jctb.2005.09.009.

harvard.edu

ui.adsabs.harvard.edu

Xiao, Mingyu; Nagamochi, Hiroshi (2012), "An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure", Algorithmica, 74 (2): 713–741, arXiv:1212.6831, Bibcode:2012arXiv1212.6831X, doi:10.1007/s00453-015-9970-4, S2CID 7654681.
Karpinski, Marek; Schmied, Richard (2013), Approximation Hardness of Graphic TSP on Cubic Graphs, arXiv:1304.6800, Bibcode:2013arXiv1304.6800K.

jgaa.info

Eppstein, David (2007), "The traveling salesman problem for cubic graphs" (PDF), Journal of Graph Algorithms and Applications, 11 (1): 61–81, arXiv:cs.DS/0302030, doi:10.7155/jgaa.00137.

jstor.org

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

math.ca

cms.math.ca

Tutte, W. T. (1959), "On the symmetry of cubic graphs", Can. J. Math., 11: 621–624, doi:10.4153/CJM-1959-057-2, S2CID 124273238, archived from the original on 2011-07-16, retrieved 2010-07-21.

semanticscholar.org

api.semanticscholar.org

Foster, R. M. (1932), "Geometrical Circuits of Electrical Networks", Transactions of the American Institute of Electrical Engineers, 51 (2): 309–317, doi:10.1109/T-AIEE.1932.5056068, S2CID 51638449.
Tutte, W. T. (1959), "On the symmetry of cubic graphs", Can. J. Math., 11: 621–624, doi:10.4153/CJM-1959-057-2, S2CID 124273238, archived from the original on 2011-07-16, retrieved 2010-07-21.
Frucht, R. (1949), "Graphs of degree three with a given abstract group", Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, S2CID 124723321.
Petersen, Julius Peter Christian (1891), "Die Theorie der regulären Graphs (The theory of regular graphs)", Acta Mathematica, 15 (15): 193–220, doi:10.1007/BF02392606, S2CID 123779343.
Esperet, Louis; Kardoš, František; King, Andrew D.; Kráľ, Daniel; Norine, Serguei (2011), "Exponentially many perfect matchings in cubic graphs", Advances in Mathematics, 227 (4): 1646–1664, arXiv:1012.2878, doi:10.1016/j.aim.2011.03.015, S2CID 4401537.
Xiao, Mingyu; Nagamochi, Hiroshi (2012), "An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure", Algorithmica, 74 (2): 713–741, arXiv:1212.6831, Bibcode:2012arXiv1212.6831X, doi:10.1007/s00453-015-9970-4, S2CID 7654681.

siam.org

epubs.siam.org

Gebauer, H. (2008), "On the number of Hamilton cycles in bounded degree graphs", Proc. 4th Workshop on Analytic Algorithmics and Combinatorics (ANALCO '08), pp. 241–248, doi:10.1137/1.9781611972986.8, ISBN 9781611972986.

tue.nl

research.tue.nl

Bussemaker, F. C.; Cobeljic, S.; Cvetkovic, D. M.; Seidel, J. J. (1976), Computer investigation of cubic graphs, EUT report, vol. 76-WSK-01, Dept. of Mathematics and Computing Science, Eindhoven University of Technology

web.archive.org

Tutte, W. T. (1959), "On the symmetry of cubic graphs", Can. J. Math., 11: 621–624, doi:10.4153/CJM-1959-057-2, S2CID 124273238, archived from the original on 2011-07-16, retrieved 2010-07-21.

worldcat.org

search.worldcat.org

Frucht, R. (1949), "Graphs of degree three with a given abstract group", Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, S2CID 124723321.

zenodo.org

Petersen, Julius Peter Christian (1891), "Die Theorie der regulären Graphs (The theory of regular graphs)", Acta Mathematica, 15 (15): 193–220, doi:10.1007/BF02392606, S2CID 123779343.