Cycle space (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Cycle space" in English language version.

refsWebsite

Global rank English rank

3^rd place

2^nd place

451^st place

277^th place

3,063^rd place

2,041^st place

26^th place

20^th place

2,656^th place

5,310^th place

4,448^th place

2,923^rd place

ams.org

Seymour, P. D. (1995), "Nowhere-zero flows", Handbook of combinatorics, Vol. 1, 2, Amsterdam: Elsevier, pp. 289–299, MR 1373660.
Rizzi, Romeo (2009), "Minimum weakly fundamental cycle bases are hard to find", Algorithmica, 53 (3): 402–424, doi:10.1007/s00453-007-9112-8, MR 2482112.
Hartvigsen, David; Mardon, Russell (1994), "The all-pairs min cut problem and the minimum cycle basis problem on planar graphs", SIAM Journal on Discrete Mathematics, 7 (3): 403–418, doi:10.1137/S0895480190177042, MR 1285579.

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.
Diestel, Reinhard (2012), "1.9 Some linear algebra", Graph Theory, Graduate Texts in Mathematics, vol. 173, Springer, pp. 23–28.
Joshi, K. D. (1997), Applied Discrete Structures, New Age International, p. 172, ISBN 9788122408263.
Wallis, W. D. (2010), A Beginner's Guide to Graph Theory, Springer, p. 66, ISBN 9780817645809.
Serre, Jean-Pierre (2003), Trees, Springer Monographs in Mathematics, Springer, p. 23, ISBN 9783540442370.
Biggs, Norman (1993), Algebraic Graph Theory, Cambridge Mathematical Library, Cambridge University Press, p. 154, ISBN 9780521458979.
Berge, Claude (2001), "Cyclomatic number", The Theory of Graphs, Courier Dover Publications, pp. 27–30, ISBN 9780486419756.

Berger, Franziska; Gritzmann, Peter; de Vries, Sven (2009), "Minimum cycle bases and their applications", Algorithmics of Large and Complex Networks, Lecture Notes in Computer Science, vol. 5515, pp. 34–49, doi:10.1007/978-3-642-02094-0_2, ISBN 978-3-642-02093-3.
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.
Rizzi, Romeo (2009), "Minimum weakly fundamental cycle bases are hard to find", Algorithmica, 53 (3): 402–424, doi:10.1007/s00453-007-9112-8, MR 2482112.
Hartvigsen, David; Mardon, Russell (1994), "The all-pairs min cut problem and the minimum cycle basis problem on planar graphs", SIAM Journal on Discrete Mathematics, 7 (3): 403–418, doi:10.1137/S0895480190177042, MR 1285579.

Thomas, Robin (1999), "Recent Excluded Minor Theorems for Graphs", Surveys in Combinatorics, 1999 (PDF), Cambridge University Press, pp. 201–222

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.

Eppstein, David (1996), On the Parity of Graph Spanning Tree Numbers (PDF), Technical Report 96-14, Department of Information and Computer Science, University of California, Irvine.