Punte (teoria grafurilor) (Romanian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Punte (teoria grafurilor)" in Romanian language version.

refsWebsite
Global rank Romanian rank
2nd place
3rd place
3rd place
6th place
451st place
697th place
43rd place
2nd place

ams.org

  • Bollobás, Béla (), Modern Graph Theory, Graduate Texts in Mathematics, 184, New York: Springer-Verlag, p. 6, doi:10.1007/978-1-4612-0619-4, ISBN 0-387-98488-7, MR 1633290 .

books.google.com

  • Bollobás, Béla (), Modern Graph Theory, Graduate Texts in Mathematics, 184, New York: Springer-Verlag, p. 6, doi:10.1007/978-1-4612-0619-4, ISBN 0-387-98488-7, MR 1633290 .

doi.org

  • Bollobás, Béla (), Modern Graph Theory, Graduate Texts in Mathematics, 184, New York: Springer-Verlag, p. 6, doi:10.1007/978-1-4612-0619-4, ISBN 0-387-98488-7, MR 1633290 .
  • Westbrook, Jeffery; Tarjan, Robert E. (), „Maintaining bridge-connected and biconnected components on-line”, Algorithmica, 7 (5-6): 433–464, doi:10.1007/BF01758773 .
  • Robbins, H. E. (), „A theorem on graphs, with an application to a problem of traffic control”, American Mathematical Monthly⁠(d), 46: 281–283, doi:10.2307/2303897 .
  • Jaeger, F. (), „A survey of the cycle double cover conjecture”, Annals of Discrete Mathematics 27 – Cycles in Graphs, North-Holland Mathematics Studies, 27, pp. 1–12, doi:10.1016/S0304-0208(08)72993-1 .
  • Tarjan, R. Endre, „A note on finding the bridges of a graph”, Information Processing Letters, 2 (6): 160–161, doi:10.1016/0020-0190(74)90003-9  Mai multe valori specificate pentru |DOI= și |doi= (ajutor).
  • Schmidt, Jens M. (), „A Simple Test on 2-Vertex- and 2-Edge-Connectivity”, Information Processing Letters, 113 (7): 241–244, doi:10.1016/j.ipl.2013.01.016 .

wikidata.org