Conexitate (teoria grafurilor) (Romanian Wikipedia)

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

refsWebsite

Global rank Romanian rank

2^nd place

3^rd place

43^rd place

2^nd place

2books.google.com

3^rd place

6^th place

1diestel-graph-theory.com

low place

low place

5,814^th place

7,523^rd place

low place

169^th place

1researchgate.net

120^th place

137^th place

1web.archive.org

1^st place

1^st place

230^th place

222^nd place

books.google.com

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

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

doi.org

Liu, Qinghai; Zhang, Zhao (1 martie 2010). „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^⁠(d). 55 (4): 1–24. doi:10.1145/1391289.1391291.
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^⁠(d). 12 (4): 777–788. doi:10.1137/0212053. .
Balinski, M. L. (1961). „On the graph structure of convex polyhedra in $n$ -space”. Pacific Journal of Mathematics^⁠(d). 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^⁠(d). 22 (1–2): 61–85. doi:10.1002/mana.19600220107. .
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. .

edu.ro

campion.edu.ro

Dana Lica, Descompunerea unui graf in componente triconexe: Algoritmul - J.E. Hopcroft si R.E. Tarjan, edu.ro, 2007, accesat 2022-08-21

elte.hu

compalg.inf.elte.hu

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

researchgate.net

Liu, Qinghai; Zhang, Zhao (1 martie 2010). „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.

uchicago.edu

cs.uchicago.edu

Babai, L. (1996). Automorphism groups, isomorphism, reconstruction. Technical Report TR-94-10. University of Chicago. Arhivat din original la 11 iunie 2010. Accesat în 5 noiembrie 2021. Chapter 27 of The Handbook of Combinatorics.

web.archive.org

Babai, L. (1996). Automorphism groups, isomorphism, reconstruction. Technical Report TR-94-10. University of Chicago. Arhivat din original la 11 iunie 2010. Accesat în 5 noiembrie 2021. Chapter 27 of The Handbook of Combinatorics.

wikidata.org

Reingold, Omer (2008). „Undirected connectivity in log-space”. Journal of the ACM^⁠(d). 55 (4): 1–24. doi:10.1145/1391289.1391291.
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^⁠(d). 12 (4): 777–788. doi:10.1137/0212053. .
Balinski, M. L. (1961). „On the graph structure of convex polyhedra in $n$ -space”. Pacific Journal of Mathematics^⁠(d). 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^⁠(d). 22 (1–2): 61–85. doi:10.1002/mana.19600220107. .