Кубический граф (Russian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Кубический граф" in Russian language version.

refsWebsite

Global rank Russian rank

11doi.org

2^nd place

3^rd place

5archive.org

6^th place

9^th place

2arxiv.org

69^th place

148^th place

1jstor.org

26^th place

145^th place

archive.org

R. Isaacs. Infinite families of nontrivial trivalent graphs which are not Tait colorable // American Mathematical Monthly. — 1975. — Т. 82, вып. 3. — С. 221—239. — doi:10.2307/2319844. — JSTOR 2319844.
C. Paul Bonnington, Charles H. C. Little. The Foundations of Topological Graph Theory. — Springer-Verlag, 1995.
J. A. Bondy, U. S. R. Murty. Graph Theory with Applications.. — New York: North Holland, 1976. — С. 240.
R. W. Robinson, N. C. Wormald. Almost all regular graphs are Hamiltonian // Random Structures and Algorithms. — 1994. — Т. 5, вып. 2. — С. 363—374. — doi:10.1002/rsa.3240050209.
Marek Karpinskiб Richard Schmied. Approximation Hardness of Graphic TSP on Cubic Graphs. — 2013. — arXiv:1304.6800.

arxiv.org

David Eppstein. The traveling salesman problem for cubic graphs // Journal of Graph Algorithms and Applications. — 2007. — Т. 11, вып. 1. — С. 61—81. — arXiv:cs.DS/0302030.
Marek Karpinskiб 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 // Transactions of the American Institute of Electrical Engineers. — 1932. — Т. 51, вып. 2. — С. 309—317. — doi:10.1109/T-AIEE.1932.5056068.
Tutte. On the symmetry of cubic graphs // Canad. J. Math. — 1959. — Т. 11. — С. 621—624. — doi:10.4153/CJM-1959-057-2.
R. Isaacs. Infinite families of nontrivial trivalent graphs which are not Tait colorable // American Mathematical Monthly. — 1975. — Т. 82, вып. 3. — С. 221—239. — doi:10.2307/2319844. — JSTOR 2319844.
M. N. Ellingham, J. D. Horton. Non-Hamiltonian 3-connected cubic bipartite graphs // Journal of Combinatorial Theory. — 1983. — Т. 34, вып. 3. — С. 350—353. — doi:10.1016/0095-8956(83)90046-1.
R. W. Robinson, N. C. Wormald. Almost all regular graphs are Hamiltonian // Random Structures and Algorithms. — 1994. — Т. 5, вып. 2. — С. 363—374. — doi:10.1002/rsa.3240050209.
Fedor V. Fomin, Kjartan Høie. Pathwidth of cubic graphs and exact algorithms // Information Processing Letters. — 2006. — Т. 97, вып. 5. — С. 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) // Acta Mathematica. — 1891. — Т. 15, вып. 15. — С. 193—220. — doi:10.1007/BF02392606.
Louis Esperet, František Kardoš, Andrew D. King, Daniel Král, Serguei Norine. Exponentially many perfect matchings in cubic graphs // Advances in Mathematics. — 2011. — Т. 227, вып. 4. — С. 1646—1664. — doi:10.1016/j.aim.2011.03.015.
Kazuo Iwama, Takuya Nakashima. Computing and Combinatorics. — Springer-Verlag, 2007. — Т. 4598. — С. 108—117. — (Lecture Notes in Computer Science). — ISBN 978-3-540-73544-1. — doi:10.1007/978-3-540-73545-8_13.
Paola Alimonti, Viggo Kann. Some APX-completeness results for cubic graphs // Theoretical Computer Science. — 2000. — Т. 237, вып. 1—2. — С. 123—134. — doi:10.1016/S0304-3975(98)00158-3.
Petr Hliněný. Crossing number is hard for cubic graphs // Journal of Combinatorial Theory. — 2006. — Т. 96, вып. 4. — С. 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 // American Mathematical Monthly. — 1975. — Т. 82, вып. 3. — С. 221—239. — doi:10.2307/2319844. — JSTOR 2319844.