Eulerian path (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Eulerian path" in English language version.

refsWebsite

Global rank English rank

12doi.org

2^nd place

4books.google.com

3^rd place

4ams.org

451^st place

277^th place

2nih.gov

4^th place

1neilsloane.com

low place

1jstor.org

26^th place

20^th place

1uga.edu

2,385^th place

1,626^th place

1cwi.nl

low place

1semanticscholar.org

11^th place

8^th place

1archive.org

6^th place

1lse.ac.uk

2,117^th place

1,361^st place

1anu.edu.au

942^nd place

597^th place

1harvard.edu

18^th place

17^th place

1psu.edu

207^th place

136^th place

1worldcat.org

5^th place

1siam.org

low place

6,473^rd place

ams.org

mathscinet.ams.org

Schrijver, A. (1983), "Bounds on the number of Eulerian orientations", Combinatorica, 3 (3–4): 375–380, doi:10.1007/BF02579193, MR 0729790, S2CID 13708977.
Tarjan, R. Endre (1974), "A note on finding the bridges of a graph", Information Processing Letters, 2 (6): 160–161, doi:10.1016/0020-0190(74)90003-9, MR 0349483.
Komjáth, Peter (2013), "Erdős's work on infinite graphs", Erdös centennial, Bolyai Soc. Math. Stud., vol. 25, János Bolyai Math. Soc., Budapest, pp. 325–345, doi:10.1007/978-3-642-39286-3_11, MR 3203602.
Bollobás, Béla (1998), Modern graph theory, Graduate Texts in Mathematics, vol. 184, Springer-Verlag, New York, p. 20, doi:10.1007/978-1-4612-0619-4, ISBN 0-387-98488-7, MR 1633290.

anu.edu.au

cs.anu.edu.au

Brendan McKay and Robert W. Robinson, Asymptotic enumeration of eulerian circuits in the complete graph, Combinatorica, 10 (1995), no. 4, 367–377.

archive.org

Fleischner, Herbert (1991), "X.1 Algorithms for Eulerian Trails", Eulerian Graphs and Related Topics: Part 1, Volume 2, Annals of Discrete Mathematics, vol. 50, Elsevier, pp. X.1–13, ISBN 978-0-444-89110-5.

books.google.com

Schaum's outline of theory and problems of graph theory By V. K. Balakrishnan [1].
Fleury, Pierre-Henry (1883), "Deux problèmes de Géométrie de situation", Journal de mathématiques élémentaires, 2nd ser. (in French), 2: 257–261.
Komjáth, Peter (2013), "Erdős's work on infinite graphs", Erdös centennial, Bolyai Soc. Math. Stud., vol. 25, János Bolyai Math. Soc., Budapest, pp. 325–345, doi:10.1007/978-3-642-39286-3_11, MR 3203602.
Bollobás, Béla (1998), Modern graph theory, Graduate Texts in Mathematics, vol. 184, Springer-Verlag, New York, p. 20, doi:10.1007/978-1-4612-0619-4, ISBN 0-387-98488-7, MR 1633290.

cwi.nl

ir.cwi.nl

Schrijver, A. (1983), "Bounds on the number of Eulerian orientations", Combinatorica, 3 (3–4): 375–380, doi:10.1007/BF02579193, MR 0729790, S2CID 13708977.

doi.org

C. L. Mallows, N. J. A. Sloane (1975). "Two-graphs, switching classes and Euler graphs are equal in number" (PDF). SIAM Journal on Applied Mathematics. 28 (4): 876–880. doi:10.1137/0128070. JSTOR 2100368.
Schrijver, A. (1983), "Bounds on the number of Eulerian orientations", Combinatorica, 3 (3–4): 375–380, doi:10.1007/BF02579193, MR 0729790, S2CID 13708977.
Pólya, George; Tarjan, Robert E.; Woods, Donald R. (October 2009), "Hamiltonian and Eulerian Paths", Notes on Introductory Combinatorics, Birkhäuser Boston, pp. 157–168, doi:10.1007/978-0-8176-4953-1_13, ISBN 9780817649531
Tarjan, R. Endre (1974), "A note on finding the bridges of a graph", Information Processing Letters, 2 (6): 160–161, doi:10.1016/0020-0190(74)90003-9, MR 0349483.
Pevzner, Pavel A.; Tang, Haixu; Waterman, Michael S. (2001). "An Eulerian trail approach to DNA fragment assembly". Proceedings of the National Academy of Sciences of the United States of America. 98 (17): 9748–9753. Bibcode:2001PNAS...98.9748P. doi:10.1073/pnas.171285098. PMC 55524. PMID 11504945.
Roy, Kuntal (2007). "Optimum Gate Ordering of CMOS Logic Gates Using Euler Path Approach: Some Insights and Explanations". Journal of Computing and Information Technology. 15 (1): 85–92. doi:10.2498/cit.1000731.
Tarjan, Robert E.; Vishkin, Uzi (1985). "An efficient parallel biconnectivity algorithm". SIAM Journal on Computing. 14 (4): 862–874. CiteSeerX 10.1.1.465.8898. doi:10.1137/0214061.
Berkman, Omer; Vishkin, Uzi (Apr 1994). "Finding level-ancestors in trees". J. Comput. Syst. Sci. 2. 48 (2): 214–230. doi:10.1016/S0022-0000(05)80002-9.
Savage, Carla (January 1997). "A Survey of Combinatorial Gray Codes". SIAM Review. 39 (4): 605–629. doi:10.1137/S0036144595295272. ISSN 0036-1445.
Komjáth, Peter (2013), "Erdős's work on infinite graphs", Erdös centennial, Bolyai Soc. Math. Stud., vol. 25, János Bolyai Math. Soc., Budapest, pp. 325–345, doi:10.1007/978-3-642-39286-3_11, MR 3203602.
Bollobás, Béla (1998), Modern graph theory, Graduate Texts in Mathematics, vol. 184, Springer-Verlag, New York, p. 20, doi:10.1007/978-1-4612-0619-4, ISBN 0-387-98488-7, MR 1633290.
Corberán, Ángel; Laporte, Gilbert, eds. (2015). Arc Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization. SIAM. doi:10.1137/1.9781611973679. ISBN 978-1-61197-366-2. Retrieved 2022-08-19.

harvard.edu

ui.adsabs.harvard.edu

Pevzner, Pavel A.; Tang, Haixu; Waterman, Michael S. (2001). "An Eulerian trail approach to DNA fragment assembly". Proceedings of the National Academy of Sciences of the United States of America. 98 (17): 9748–9753. Bibcode:2001PNAS...98.9748P. doi:10.1073/pnas.171285098. PMC 55524. PMID 11504945.

jstor.org

C. L. Mallows, N. J. A. Sloane (1975). "Two-graphs, switching classes and Euler graphs are equal in number" (PDF). SIAM Journal on Applied Mathematics. 28 (4): 876–880. doi:10.1137/0128070. JSTOR 2100368.

lse.ac.uk

cdam.lse.ac.uk

Brightwell and Winkler, "Note on Counting Eulerian Circuits", 2004.

neilsloane.com

C. L. Mallows, N. J. A. Sloane (1975). "Two-graphs, switching classes and Euler graphs are equal in number" (PDF). SIAM Journal on Applied Mathematics. 28 (4): 876–880. doi:10.1137/0128070. JSTOR 2100368.

nih.gov

ncbi.nlm.nih.gov

Pevzner, Pavel A.; Tang, Haixu; Waterman, Michael S. (2001). "An Eulerian trail approach to DNA fragment assembly". Proceedings of the National Academy of Sciences of the United States of America. 98 (17): 9748–9753. Bibcode:2001PNAS...98.9748P. doi:10.1073/pnas.171285098. PMC 55524. PMID 11504945.

pubmed.ncbi.nlm.nih.gov

Pevzner, Pavel A.; Tang, Haixu; Waterman, Michael S. (2001). "An Eulerian trail approach to DNA fragment assembly". Proceedings of the National Academy of Sciences of the United States of America. 98 (17): 9748–9753. Bibcode:2001PNAS...98.9748P. doi:10.1073/pnas.171285098. PMC 55524. PMID 11504945.

psu.edu

citeseerx.ist.psu.edu

Tarjan, Robert E.; Vishkin, Uzi (1985). "An efficient parallel biconnectivity algorithm". SIAM Journal on Computing. 14 (4): 862–874. CiteSeerX 10.1.1.465.8898. doi:10.1137/0214061.

semanticscholar.org

api.semanticscholar.org

Schrijver, A. (1983), "Bounds on the number of Eulerian orientations", Combinatorica, 3 (3–4): 375–380, doi:10.1007/BF02579193, MR 0729790, S2CID 13708977.

siam.org

epubs.siam.org

Corberán, Ángel; Laporte, Gilbert, eds. (2015). Arc Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization. SIAM. doi:10.1137/1.9781611973679. ISBN 978-1-61197-366-2. Retrieved 2022-08-19.

uga.edu

jwilson.coe.uga.edu

Jun-ichi Yamaguchi, Introduction of Graph Theory.

worldcat.org

Savage, Carla (January 1997). "A Survey of Combinatorial Gray Codes". SIAM Review. 39 (4): 605–629. doi:10.1137/S0036144595295272. ISSN 0036-1445.