Espesor (teoría de grafos) (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Espesor (teoría de grafos)" in Spanish language version.

refsWebsite

Global rank Spanish rank

8ams.org

451^st place

1,294^th place

6doi.org

2^nd place

1cccg.ca

low place

1projecteuclid.org

3,707^th place

5,780^th place

1mpg.de

1,624^th place

1,022^nd place

1arxiv.org

69^th place

148^th place

ams.org

Tutte, W. T. (1963), «The thickness of a graph», Indag. Math. 25: 567-577, MR 0157372 ..
Mutzel, Petra; Odenthal, Thomas; Scharbrodt, Mark (1998), «The thickness of graphs: a survey», Graphs and Combinatorics 14 (1): 59-73, MR 1617664, doi:10.1007/PL00007219 ..
Alekseev, V. B.; Gončakov, V. S. (1976), «The thickness of an arbitrary complete graph», Mat. Sb., New Series 101 (143): 212-230, MR 0460162 ..
Beineke, Lowell W.; Harary, Frank; Moon, John W. (1964), «On the thickness of the complete bipartite graph», Proc. Cambridge Philos. Soc. 60: 1-5, MR 0158388, doi:10.1017/s0305004100037385 ..
Dean, Alice M.; Hutchinson, Joan P.; Scheinerman, Edward R. (1991), «On the thickness and arboricity of a graph», Journal of Combinatorial Theory, Series B 52 (1): 147-151, MR 1109429, doi:10.1016/0095-8956(91)90100-X ..
Brass, Peter; Cenek, Eowyn; Duncan, Cristian A.; Efrat, Alon; Erten, Cesim; Ismailescu, Dan P.; Kobourov, Stephen G.; Lubiw, Anna et al. (2007), «On simultaneous planar graph embeddings», Computational Geometry 36 (2): 117-130, MR 2278011, doi:10.1016/j.comgeo.2006.05.006 ..
Eppstein, David (2004), «Separating thickness from geometric thickness», Towards a theory of geometric graphs, Contemp. Math. 342, Amer. Math. Soc., Providence, RI, pp. 75-86, MR 2065254, arXiv:math/0204252, doi:10.1090/conm/342/06132 ..
Mansfield, Anthony (1983), «Determining the thickness of graphs is NP-hard», Mathematical Proceedings of the Cambridge Philosophical Society 93 (1): 9-23, MR 684270, doi:10.1017/S030500410006028X ..

arxiv.org

Eppstein, David (2004), «Separating thickness from geometric thickness», Towards a theory of geometric graphs, Contemp. Math. 342, Amer. Math. Soc., Providence, RI, pp. 75-86, MR 2065254, arXiv:math/0204252, doi:10.1090/conm/342/06132 ..

cccg.ca

Christian A. Duncan, On Graph Thickness, Geometric Thickness, and Separator Theorems, CCCG 2009, Vancouver, BC, August 17–19, 2009

doi.org

dx.doi.org

Mutzel, Petra; Odenthal, Thomas; Scharbrodt, Mark (1998), «The thickness of graphs: a survey», Graphs and Combinatorics 14 (1): 59-73, MR 1617664, doi:10.1007/PL00007219 ..
Beineke, Lowell W.; Harary, Frank; Moon, John W. (1964), «On the thickness of the complete bipartite graph», Proc. Cambridge Philos. Soc. 60: 1-5, MR 0158388, doi:10.1017/s0305004100037385 ..
Dean, Alice M.; Hutchinson, Joan P.; Scheinerman, Edward R. (1991), «On the thickness and arboricity of a graph», Journal of Combinatorial Theory, Series B 52 (1): 147-151, MR 1109429, doi:10.1016/0095-8956(91)90100-X ..
Brass, Peter; Cenek, Eowyn; Duncan, Cristian A.; Efrat, Alon; Erten, Cesim; Ismailescu, Dan P.; Kobourov, Stephen G.; Lubiw, Anna et al. (2007), «On simultaneous planar graph embeddings», Computational Geometry 36 (2): 117-130, MR 2278011, doi:10.1016/j.comgeo.2006.05.006 ..
Eppstein, David (2004), «Separating thickness from geometric thickness», Towards a theory of geometric graphs, Contemp. Math. 342, Amer. Math. Soc., Providence, RI, pp. 75-86, MR 2065254, arXiv:math/0204252, doi:10.1090/conm/342/06132 ..
Mansfield, Anthony (1983), «Determining the thickness of graphs is NP-hard», Mathematical Proceedings of the Cambridge Philosophical Society 93 (1): 9-23, MR 684270, doi:10.1017/S030500410006028X ..

mpg.de

domino.mpi-inf.mpg.de

Petra Mutzel, Thomas Odenthal and Mark Scharbrodt, The Thickness of Graphs: A Survey

projecteuclid.org

Mäkinen, Erkki; Poranen, Timo (2012). «An Annotated Bibliography on the Thickness, Outerthickness, and Arboricity of a Graph». Missouri J. Math. Sci. 24 (1): 76-87.