Connectivity (graph theory) (English Wikipedia)

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

refsWebsite

Global rank English rank

2^nd place

2^nd place

451^st place

277^th place

2books.google.com

3^rd place

3^rd place

1diestel-graph-theory.com

low place

low place

low place

low place

1researchgate.net

120^th place

125^th place

207^th place

136^th place

1semanticscholar.org

11^th place

8^th place

1web.archive.org

1^st place

1^st place

230^th place

214^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Provan, J. Scott; Ball, Michael O. (1983). "The complexity of counting cuts and of computing the probability that a graph is connected". SIAM Journal on Computing. 12 (4): 777–788. doi:10.1137/0212053. MR 0721012..
Dirac, Gabriel Andrew (1960). "In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen". Mathematische Nachrichten. 22 (1–2): 61–85. doi:10.1002/mana.19600220107. MR 0121311..
Flandrin, Evelyne; Li, Hao; Marczyk, Antoni; Woźniak, Mariusz (2007). "A generalization of Dirac's theorem on cycles through $k$ vertices in $k$ -connected graphs". Discrete Mathematics. 307 (7–8): 878–884. doi:10.1016/j.disc.2005.11.052. MR 2297171..

books.google.com (Global: 3^rd place; English: 3^rd place)

Gross, Jonathan L.; Yellen, Jay (2004). Handbook of graph theory. CRC Press. p. 335. ISBN 978-1-58488-090-5.
Gross, Jonathan L.; Yellen, Jay (2004). Handbook of graph theory. CRC Press. p. 338. ISBN 978-1-58488-090-5.

diestel-graph-theory.com (Global: low place; English: low place)

Diestel, R. (2005). "Graph Theory, Electronic Edition". p. 12.

doi.org (Global: 2^nd place; English: 2^nd place)

Liu, Qinghai; Zhang, Zhao (2010-03-01). "The existence and upper bound for two types of restricted connectivity". Discrete Applied Mathematics. 158 (5): 516–521. doi:10.1016/j.dam.2009.10.017.
Reingold, Omer (2008). "Undirected connectivity in log-space". Journal of the ACM. 55 (4): 1–24. doi:10.1145/1391289.1391291. S2CID 207168478.
Provan, J. Scott; Ball, Michael O. (1983). "The complexity of counting cuts and of computing the probability that a graph is connected". SIAM Journal on Computing. 12 (4): 777–788. doi:10.1137/0212053. MR 0721012..
Balinski, M. L. (1961). "On the graph structure of convex polyhedra in $n$ -space". Pacific Journal of Mathematics. 11 (2): 431–434. doi:10.2140/pjm.1961.11.431.
Dirac, Gabriel Andrew (1960). "In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen". Mathematische Nachrichten. 22 (1–2): 61–85. doi:10.1002/mana.19600220107. MR 0121311..
Flandrin, Evelyne; Li, Hao; Marczyk, Antoni; Woźniak, Mariusz (2007). "A generalization of Dirac's theorem on cycles through $k$ vertices in $k$ -connected graphs". Discrete Mathematics. 307 (7–8): 878–884. doi:10.1016/j.disc.2005.11.052. MR 2297171..

metu.edu.tr (Global: low place; English: low place)

users.metu.edu.tr

Chapter 11: Digraphs: Principle of duality for digraphs: Definition

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Balbuena, Camino; Carmona, Angeles (2001-10-01). "On the connectivity and superconnectivity of bipartite digraphs and graphs". Ars Combinatorica. 61: 3–22. CiteSeerX 10.1.1.101.1458.

researchgate.net (Global: 120^th place; English: 125^th place)

Liu, Qinghai; Zhang, Zhao (2010-03-01). "The existence and upper bound for two types of restricted connectivity". Discrete Applied Mathematics. 158 (5): 516–521. doi:10.1016/j.dam.2009.10.017.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Reingold, Omer (2008). "Undirected connectivity in log-space". Journal of the ACM. 55 (4): 1–24. doi:10.1145/1391289.1391291. S2CID 207168478.

uchicago.edu (Global: 230^th place; English: 214^th place)

cs.uchicago.edu

Babai, L. (1996). Automorphism groups, isomorphism, reconstruction. Technical Report TR-94-10. University of Chicago. Archived from the original on 2010-06-11. Chapter 27 of The Handbook of Combinatorics.

web.archive.org (Global: 1^st place; English: 1^st place)

Babai, L. (1996). Automorphism groups, isomorphism, reconstruction. Technical Report TR-94-10. University of Chicago. Archived from the original on 2010-06-11. Chapter 27 of The Handbook of Combinatorics.