گراف مکعب (Persian Wikipedia)

Analysis of information sources in references of the Wikipedia article "گراف مکعب" in Persian language version.

refsWebsite
Global rank Persian rank
2nd place
2nd place
69th place
253rd place
low place
low place

arxiv.org

  • Xiao, Mingyu; Nagamochi, Hiroshi (2012), An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure, arXiv:1212.6831.
  • Karpinski, Marek; Schmied, Richard (2013), Approximation Hardness of Graphic TSP on Cubic Graphs, arXiv:1304.6800.

doi.org

  • 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.
  • 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.
  • 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, doi:10.1016/j.aim.2011.03.015.
  • 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, doi:10.1007/978-3-642-38236-9_10, ISBN 978-3-642-38236-9.
  • 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.

siam.org

zeno.siam.org