Thickness (graph theory) (English Wikipedia)

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

refsWebsite

Global rank English rank

12doi.org

2^nd place

12ams.org

451^st place

277^th place

4semanticscholar.org

11^th place

8^th place

3harvard.edu

18^th place

17^th place

1mpg.de

1,624^th place

1,592^nd place

1psu.edu

207^th place

136^th place

1cccg.ca

low place

1projecteuclid.org

3,707^th place

2,409^th place

1arxiv.org

69^th place

59^th place

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

mathscinet.ams.org

Tutte, W. T. (1963), "The thickness of a graph", Indag. Math., 66: 567–577, doi:10.1016/S1385-7258(63)50055-9, MR 0157372.
Mutzel, Petra; Odenthal, Thomas; Scharbrodt, Mark (1998), "The thickness of graphs: a survey" (PDF), Graphs and Combinatorics, 14 (1): 59–73, CiteSeerX 10.1.1.34.6528, doi:10.1007/PL00007219, MR 1617664, S2CID 31670574.
Ringel, Gerhard (1959), Färbungsprobleme auf Flächen und Graphen, Mathematische Monographien, vol. 2, Berlin: VEB Deutscher Verlag der Wissenschaften, MR 0109349
Alekseev, V. B.; Gončakov, V. S. (1976), "The thickness of an arbitrary complete graph", Mat. Sb., New Series, 101 (143): 212–230, Bibcode:1976SbMat..30..187A, doi:10.1070/SM1976v030n02ABEH002267, MR 0460162.
Beineke, Lowell W.; Harary, Frank; Moon, John W. (1964), "On the thickness of the complete bipartite graph", Mathematical Proceedings of the Cambridge Philosophical Society, 60 (1): 1–5, Bibcode:1964PCPS...60....1B, doi:10.1017/s0305004100037385, MR 0158388, S2CID 122829092.
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, doi:10.1016/0095-8956(91)90100-X, MR 1109429.
Halton, John H. (1991), "On the thickness of graphs of given degree", Information Sciences, 54 (3): 219–238, doi:10.1016/0020-0255(91)90052-V, MR 1079441
Sýkora, Ondrej; Székely, László A.; Vrt'o, Imrich (2004), "A note on Halton's conjecture", Information Sciences, 164 (1–4): 61–64, doi:10.1016/j.ins.2003.06.008, MR 2076570
Gethner, Ellen (2018), "To the Moon and beyond", in Gera, Ralucca; Haynes, Teresa W.; Hedetniemi, Stephen T. (eds.), Graph Theory: Favorite Conjectures and Open Problems, II, Problem Books in Mathematics, Springer International Publishing, pp. 115–133, doi:10.1007/978-3-319-97686-0_11, ISBN 978-3-319-97684-6, MR 3930641
Brass, Peter; Cenek, Eowyn; Duncan, Christian A.; Efrat, Alon; Erten, Cesim; Ismailescu, Dan P.; Kobourov, Stephen G.; Lubiw, Anna; Mitchell, Joseph S. B. (2007), "On simultaneous planar graph embeddings", Computational Geometry, 36 (2): 117–130, doi:10.1016/j.comgeo.2006.05.006, MR 2278011.
Eppstein, David (2004), "Separating thickness from geometric thickness", Towards a theory of geometric graphs, Contemp. Math., vol. 342, Amer. Math. Soc., Providence, RI, pp. 75–86, arXiv:math/0204252, doi:10.1090/conm/342/06132, ISBN 978-0-8218-3484-8, MR 2065254.
Mansfield, Anthony (1983), "Determining the thickness of graphs is NP-hard", Mathematical Proceedings of the Cambridge Philosophical Society, 93 (1): 9–23, Bibcode:1983MPCPS..93....9M, doi:10.1017/S030500410006028X, MR 0684270, S2CID 122028023.

arxiv.org (Global: 69^th place; English: 59^th place)

Eppstein, David (2004), "Separating thickness from geometric thickness", Towards a theory of geometric graphs, Contemp. Math., vol. 342, Amer. Math. Soc., Providence, RI, pp. 75–86, arXiv:math/0204252, doi:10.1090/conm/342/06132, ISBN 978-0-8218-3484-8, MR 2065254.

cccg.ca (Global: low place; English: low place)

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

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

Tutte, W. T. (1963), "The thickness of a graph", Indag. Math., 66: 567–577, doi:10.1016/S1385-7258(63)50055-9, MR 0157372.
Mutzel, Petra; Odenthal, Thomas; Scharbrodt, Mark (1998), "The thickness of graphs: a survey" (PDF), Graphs and Combinatorics, 14 (1): 59–73, CiteSeerX 10.1.1.34.6528, doi:10.1007/PL00007219, MR 1617664, S2CID 31670574.
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, doi:10.35834/mjms/1337950501, S2CID 117703458
Alekseev, V. B.; Gončakov, V. S. (1976), "The thickness of an arbitrary complete graph", Mat. Sb., New Series, 101 (143): 212–230, Bibcode:1976SbMat..30..187A, doi:10.1070/SM1976v030n02ABEH002267, MR 0460162.
Beineke, Lowell W.; Harary, Frank; Moon, John W. (1964), "On the thickness of the complete bipartite graph", Mathematical Proceedings of the Cambridge Philosophical Society, 60 (1): 1–5, Bibcode:1964PCPS...60....1B, doi:10.1017/s0305004100037385, MR 0158388, S2CID 122829092.
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, doi:10.1016/0095-8956(91)90100-X, MR 1109429.
Halton, John H. (1991), "On the thickness of graphs of given degree", Information Sciences, 54 (3): 219–238, doi:10.1016/0020-0255(91)90052-V, MR 1079441
Sýkora, Ondrej; Székely, László A.; Vrt'o, Imrich (2004), "A note on Halton's conjecture", Information Sciences, 164 (1–4): 61–64, doi:10.1016/j.ins.2003.06.008, MR 2076570
Gethner, Ellen (2018), "To the Moon and beyond", in Gera, Ralucca; Haynes, Teresa W.; Hedetniemi, Stephen T. (eds.), Graph Theory: Favorite Conjectures and Open Problems, II, Problem Books in Mathematics, Springer International Publishing, pp. 115–133, doi:10.1007/978-3-319-97686-0_11, ISBN 978-3-319-97684-6, MR 3930641
Brass, Peter; Cenek, Eowyn; Duncan, Christian A.; Efrat, Alon; Erten, Cesim; Ismailescu, Dan P.; Kobourov, Stephen G.; Lubiw, Anna; Mitchell, Joseph S. B. (2007), "On simultaneous planar graph embeddings", Computational Geometry, 36 (2): 117–130, doi:10.1016/j.comgeo.2006.05.006, MR 2278011.
Eppstein, David (2004), "Separating thickness from geometric thickness", Towards a theory of geometric graphs, Contemp. Math., vol. 342, Amer. Math. Soc., Providence, RI, pp. 75–86, arXiv:math/0204252, doi:10.1090/conm/342/06132, ISBN 978-0-8218-3484-8, MR 2065254.
Mansfield, Anthony (1983), "Determining the thickness of graphs is NP-hard", Mathematical Proceedings of the Cambridge Philosophical Society, 93 (1): 9–23, Bibcode:1983MPCPS..93....9M, doi:10.1017/S030500410006028X, MR 0684270, S2CID 122028023.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Alekseev, V. B.; Gončakov, V. S. (1976), "The thickness of an arbitrary complete graph", Mat. Sb., New Series, 101 (143): 212–230, Bibcode:1976SbMat..30..187A, doi:10.1070/SM1976v030n02ABEH002267, MR 0460162.
Beineke, Lowell W.; Harary, Frank; Moon, John W. (1964), "On the thickness of the complete bipartite graph", Mathematical Proceedings of the Cambridge Philosophical Society, 60 (1): 1–5, Bibcode:1964PCPS...60....1B, doi:10.1017/s0305004100037385, MR 0158388, S2CID 122829092.
Mansfield, Anthony (1983), "Determining the thickness of graphs is NP-hard", Mathematical Proceedings of the Cambridge Philosophical Society, 93 (1): 9–23, Bibcode:1983MPCPS..93....9M, doi:10.1017/S030500410006028X, MR 0684270, S2CID 122028023.

mpg.de (Global: 1,624^th place; English: 1,592^nd place)

domino.mpi-inf.mpg.de

Mutzel, Petra; Odenthal, Thomas; Scharbrodt, Mark (1998), "The thickness of graphs: a survey" (PDF), Graphs and Combinatorics, 14 (1): 59–73, CiteSeerX 10.1.1.34.6528, doi:10.1007/PL00007219, MR 1617664, S2CID 31670574.

projecteuclid.org (Global: 3,707^th place; English: 2,409^th place)

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, doi:10.35834/mjms/1337950501, S2CID 117703458

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

citeseerx.ist.psu.edu

Mutzel, Petra; Odenthal, Thomas; Scharbrodt, Mark (1998), "The thickness of graphs: a survey" (PDF), Graphs and Combinatorics, 14 (1): 59–73, CiteSeerX 10.1.1.34.6528, doi:10.1007/PL00007219, MR 1617664, S2CID 31670574.

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

api.semanticscholar.org

Mutzel, Petra; Odenthal, Thomas; Scharbrodt, Mark (1998), "The thickness of graphs: a survey" (PDF), Graphs and Combinatorics, 14 (1): 59–73, CiteSeerX 10.1.1.34.6528, doi:10.1007/PL00007219, MR 1617664, S2CID 31670574.
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, doi:10.35834/mjms/1337950501, S2CID 117703458
Beineke, Lowell W.; Harary, Frank; Moon, John W. (1964), "On the thickness of the complete bipartite graph", Mathematical Proceedings of the Cambridge Philosophical Society, 60 (1): 1–5, Bibcode:1964PCPS...60....1B, doi:10.1017/s0305004100037385, MR 0158388, S2CID 122829092.
Mansfield, Anthony (1983), "Determining the thickness of graphs is NP-hard", Mathematical Proceedings of the Cambridge Philosophical Society, 93 (1): 9–23, Bibcode:1983MPCPS..93....9M, doi:10.1017/S030500410006028X, MR 0684270, S2CID 122028023.

Thickness (graph theory) (English Wikipedia)

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

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

cccg.ca (Global: low place; English: low place)

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

harvard.edu (Global: 18th place; English: 17th place)