Cycle (graph theory) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Cycle (graph theory)" in English language version.

refsWebsite

Global rank English rank

5doi.org

2^nd place

3books.google.com

3^rd place

3web.archive.org

1^st place

2archive.org

6^th place

2semanticscholar.org

11^th place

8^th place

2jstor.org

26^th place

20^th place

1maa.org

3,479^th place

2,444^th place

1cantab.net

low place

1pitt.edu

1,476^th place

1,056^th place

1uoa.gr

9,203^rd place

low place

archive.org

Sedgewick, Robert (1983), "Graph algorithms", Algorithms, Addison–Wesley, ISBN 0-201-06672-6
Silberschatz, Abraham; Peter Galvin; Greg Gagne (2003). Operating System Concepts. John Wiley & Sons, INC. pp. 260. ISBN 0-471-25060-0.

books.google.com

Bender & Williamson 2010, p. 164. Bender, Edward A.; Williamson, S. Gill (2010). Lists, Decisions and Graphs. With an Introduction to Probability.
Gross, Jonathan L.; Yellen, Jay (2005), "4.6 Graphs and Vector Spaces", Graph Theory and Its Applications (2nd ed.), CRC Press, pp. 197–207, ISBN 9781584885054, archived from the original on 2023-02-04, retrieved 2016-09-27.
Diestel, Reinhard (2012), "1.9 Some linear algebra", Graph Theory, Graduate Texts in Mathematics, vol. 173, Springer, pp. 23–28, archived from the original on 2023-02-04, retrieved 2016-09-27.

cantab.net

Euler, Leonhard (1741). "Solutio problematis ad geometriam situs pertinentis". Commentarii Academiae Scientiarum Petropolitanae (in Latin). 8: 128-140 + Plate VIII. Translated into English as Solution of a problem in the geometry of position, Michael Behrend.

doi.org

Räz, Tim (2018). "Euler's Königsberg: The explanatory power of mathematics" (PDF). European Journal for Philosophy of Science. 8 (3): 331–346. doi:10.1007/s13194-017-0189-x. S2CID 125194454. Arguably, the fact that Euler's paper stands at the beginnings of graph theory is its most important innovation.
Shields, Rob (2012). "Cultural Topology: The Seven Bridges of Königsburg 1736". Theory, Culture & Society. 29 (4–5): 43–57. doi:10.1177/0263276412451161. S2CID 146875675.
Veblen, Oswald (1912), "An Application of Modular Equations in Analysis Situs", Annals of Mathematics, Second Series, 14 (1): 86–94, doi:10.2307/1967604, JSTOR 1967604.
Ore, Ø. (1960), "Note on Hamilton circuits", American Mathematical Monthly, 67 (1): 55, doi:10.2307/2308928, JSTOR 2308928.
Jaeger, F. (1985), "A survey of the cycle double cover conjecture", Annals of Discrete Mathematics 27 – Cycles in Graphs, North-Holland Mathematics Studies, vol. 27, pp. 1–12, doi:10.1016/S0304-0208(08)72993-1, ISBN 978-0-444-87803-8.

jstor.org

Veblen, Oswald (1912), "An Application of Modular Equations in Analysis Situs", Annals of Mathematics, Second Series, 14 (1): 86–94, doi:10.2307/1967604, JSTOR 1967604.
Ore, Ø. (1960), "Note on Hamilton circuits", American Mathematical Monthly, 67 (1): 55, doi:10.2307/2308928, JSTOR 2308928.

maa.org

eulerarchive.maa.org

Euler, Leonhard (1741). "Solutio problematis ad geometriam situs pertinentis". Commentarii Academiae Scientiarum Petropolitanae (in Latin). 8: 128-140 + Plate VIII. Translated into English as Solution of a problem in the geometry of position, Michael Behrend.

pitt.edu

philsci-archive.pitt.edu

Räz, Tim (2018). "Euler's Königsberg: The explanatory power of mathematics" (PDF). European Journal for Philosophy of Science. 8 (3): 331–346. doi:10.1007/s13194-017-0189-x. S2CID 125194454. Arguably, the fact that Euler's paper stands at the beginnings of graph theory is its most important innovation.

semanticscholar.org

api.semanticscholar.org

Räz, Tim (2018). "Euler's Königsberg: The explanatory power of mathematics" (PDF). European Journal for Philosophy of Science. 8 (3): 331–346. doi:10.1007/s13194-017-0189-x. S2CID 125194454. Arguably, the fact that Euler's paper stands at the beginnings of graph theory is its most important innovation.
Shields, Rob (2012). "Cultural Topology: The Seven Bridges of Königsburg 1736". Theory, Culture & Society. 29 (4–5): 43–57. doi:10.1177/0263276412451161. S2CID 146875675.

uoa.gr

cgi.di.uoa.gr

Richard M. Karp (1972), "Reducibility Among Combinatorial Problems" (PDF), in R. E. Miller and J. W. Thatcher (ed.), Complexity of Computer Computations, New York: Plenum, pp. 85–103, archived (PDF) from the original on 2021-02-10, retrieved 2014-03-12{{citation}}: CS1 maint: publisher location (link).

web.archive.org

Gross, Jonathan L.; Yellen, Jay (2005), "4.6 Graphs and Vector Spaces", Graph Theory and Its Applications (2nd ed.), CRC Press, pp. 197–207, ISBN 9781584885054, archived from the original on 2023-02-04, retrieved 2016-09-27.
Diestel, Reinhard (2012), "1.9 Some linear algebra", Graph Theory, Graduate Texts in Mathematics, vol. 173, Springer, pp. 23–28, archived from the original on 2023-02-04, retrieved 2016-09-27.
Richard M. Karp (1972), "Reducibility Among Combinatorial Problems" (PDF), in R. E. Miller and J. W. Thatcher (ed.), Complexity of Computer Computations, New York: Plenum, pp. 85–103, archived (PDF) from the original on 2021-02-10, retrieved 2014-03-12{{citation}}: CS1 maint: publisher location (link).