Planar graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Planar graph" in English language version.

refsWebsite

Global rank English rank

17doi.org

2^nd place

10semanticscholar.org

11^th place

8^th place

6arxiv.org

69^th place

59^th place

4ams.org

451^st place

277^th place

2harvard.edu

18^th place

17^th place

2psu.edu

207^th place

136^th place

1doverpublications.com

low place

1books.google.com

3^rd place

1strath.ac.uk

low place

7,329^th place

1inria.fr

4,903^rd place

3,679^th place

ams.org

mathscinet.ams.org

Schnyder, W. (1989), "Planar graphs and poset dimension", Order, 5 (4): 323–343, doi:10.1007/BF00353652, MR 1010382, S2CID 122785359.
Hakimi, S. L.; Schmeichel, E. F. (1978), "On the connectivity of maximal planar graphs", Journal of Graph Theory, 2 (4): 307–314, doi:10.1002/jgt.3190020404, MR 0512801; Hakimi and Schmeichel credit the 3-connectivity of maximal planar graphs to a theorem of Hassler Whitney.
Seymour, P. D.; Weaver, R. W. (1984), "A generalization of chordal graphs", Journal of Graph Theory, 8 (2): 241–251, doi:10.1002/jgt.3190080206, MR 0742878.
Felsner, Stefan (2004), "1.4 Outerplanar Graphs and Convex Geometric Graphs", Geometric graphs and arrangements, Advanced Lectures in Mathematics, Friedr. Vieweg & Sohn, Wiesbaden, pp. 6–7, doi:10.1007/978-3-322-80303-0_1, ISBN 3-528-06972-4, MR 2061507

arxiv.org

Chen, T. Z. Q.; Kitaev, S.; Sun, B. Y. (2016), "Word-representability of face subdivisions of triangular grid graphs", Graphs and Combin, 32 (5): 1749–61, arXiv:1503.08002, doi:10.1007/s00373-016-1693-z, S2CID 43817300
Chen, T. Z. Q.; Kitaev, S.; Sun, B. Y. (2016), "Word-representability of triangulations of grid-covered cylinder graphs", Discr. Appl. Math., 213: 60–70, arXiv:1507.06749, doi:10.1016/j.dam.2016.05.025, S2CID 26987743
Giménez, Omer; Noy, Marc (2009), "Asymptotic enumeration and limit laws of planar graphs", Journal of the American Mathematical Society, 22 (2): 309–329, arXiv:math/0501269, Bibcode:2009JAMS...22..309G, doi:10.1090/s0894-0347-08-00624-3, S2CID 3353537
Dujmović, Vida; Joret, Gwenäel; Micek, Piotr; Morin, Pat; Ueckerdt, Torsten; Wood, David R. (2020), "Planar graphs have bounded queue number", Journal of the ACM, 67 (4): 22:1–22:38, arXiv:1904.04791, doi:10.1145/3385731
Bose, Prosenjit; Dujmović, Vida; Javarsineh, Mehrnoosh; Morin, Pat (2020), Asymptotically optimal vertex ranking of planar graphs, arXiv:2007.06455
Dębski, Michał; Felsner, Stefan; Micek, Piotr; Schröder, Felix (2021), "Improved Bounds for Centered Colorings", Advances in Combinatorics, arXiv:1907.04586, doi:10.19086/aic.27351, S2CID 195874032

books.google.com

Barthelemy, M. (2017), "1.5 Planar Graphs", Morphogenesis of Spatial Networks, Springer, p. 6, ISBN 978-3-319-20565-6

doi.org

Buhl, J.; Gautrais, J.; Sole, R.V.; Kuntz, P.; Valverde, S.; Deneubourg, J.L.; Theraulaz, G. (2004), "Efficiency and robustness in ant networks of galleries", European Physical Journal B, 42 (1): 123–129, Bibcode:2004EPJB...42..123B, doi:10.1140/epjb/e2004-00364-9, S2CID 14975826.
Schnyder, W. (1989), "Planar graphs and poset dimension", Order, 5 (4): 323–343, doi:10.1007/BF00353652, MR 1010382, S2CID 122785359.
Bhasker, Jayaram; Sahni, Sartaj (1988), "A linear algorithm to find a rectangular dual of a planar triangulated graph", Algorithmica, 3 (1–4): 247–278, doi:10.1007/BF01762117, S2CID 2709057.
Hakimi, S. L.; Schmeichel, E. F. (1978), "On the connectivity of maximal planar graphs", Journal of Graph Theory, 2 (4): 307–314, doi:10.1002/jgt.3190020404, MR 0512801; Hakimi and Schmeichel credit the 3-connectivity of maximal planar graphs to a theorem of Hassler Whitney.
Seymour, P. D.; Weaver, R. W. (1984), "A generalization of chordal graphs", Journal of Graph Theory, 8 (2): 241–251, doi:10.1002/jgt.3190080206, MR 0742878.
Felsner, Stefan (2004), "1.4 Outerplanar Graphs and Convex Geometric Graphs", Geometric graphs and arrangements, Advanced Lectures in Mathematics, Friedr. Vieweg & Sohn, Wiesbaden, pp. 6–7, doi:10.1007/978-3-322-80303-0_1, ISBN 3-528-06972-4, MR 2061507
Sysło, Maciej M.; Proskurowski, Andrzej (1983), "On Halin graphs", Graph Theory: Proceedings of a Conference held in Lagów, Poland, February 10–13, 1981, Lecture Notes in Mathematics, vol. 1018, Springer-Verlag, pp. 248–256, doi:10.1007/BFb0071635, ISBN 978-3-540-12687-4.
Halldórsson, M.; Kitaev, S.; Pyatkin., A. (2016), "Semi-transitive orientations and word-representable graphs" (PDF), Discr. Appl. Math., 201: 164–171, doi:10.1016/j.dam.2015.07.033, S2CID 26796091
Chen, T. Z. Q.; Kitaev, S.; Sun, B. Y. (2016), "Word-representability of face subdivisions of triangular grid graphs", Graphs and Combin, 32 (5): 1749–61, arXiv:1503.08002, doi:10.1007/s00373-016-1693-z, S2CID 43817300
Chen, T. Z. Q.; Kitaev, S.; Sun, B. Y. (2016), "Word-representability of triangulations of grid-covered cylinder graphs", Discr. Appl. Math., 213: 60–70, arXiv:1507.06749, doi:10.1016/j.dam.2016.05.025, S2CID 26987743
Giménez, Omer; Noy, Marc (2009), "Asymptotic enumeration and limit laws of planar graphs", Journal of the American Mathematical Society, 22 (2): 309–329, arXiv:math/0501269, Bibcode:2009JAMS...22..309G, doi:10.1090/s0894-0347-08-00624-3, S2CID 3353537
McDiarmid, Colin; Steger, Angelika; Welsh, Dominic J.A. (2005), "Random planar graphs", Journal of Combinatorial Theory, Series B, 93 (2): 187–205, CiteSeerX 10.1.1.572.857, doi:10.1016/j.jctb.2004.09.007
Bonichon, N.; Gavoille, C.; Hanusse, N.; Poulalhon, D.; Schaeffer, G. (2006), "Planar Graphs, via Well-Orderly Maps and Trees", Graphs and Combinatorics, 22 (2): 185–202, CiteSeerX 10.1.1.106.7456, doi:10.1007/s00373-006-0647-2, S2CID 22639942
Dujmović, Vida; Joret, Gwenäel; Micek, Piotr; Morin, Pat; Ueckerdt, Torsten; Wood, David R. (2020), "Planar graphs have bounded queue number", Journal of the ACM, 67 (4): 22:1–22:38, arXiv:1904.04791, doi:10.1145/3385731
Dębski, Michał; Felsner, Stefan; Micek, Piotr; Schröder, Felix (2021), "Improved Bounds for Centered Colorings", Advances in Combinatorics, arXiv:1907.04586, doi:10.19086/aic.27351, S2CID 195874032
Filotti, I. S.; Mayer, Jack N. (1980), "A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus", Proceedings of the 12th Annual ACM Symposium on Theory of Computing (PDF), pp. 236–243, doi:10.1145/800141.804671, ISBN 978-0-89791-017-0, S2CID 16345164
Wood, D. R. (2007). On the Maximum Number of Cliques in a Graph. Graphs and Combinatorics, 23(3), 337–352. https://doi.org/10.1007/s00373-007-0738-8

doverpublications.com

store.doverpublications.com

Trudeau, Richard J. (1993), Introduction to Graph Theory (Corrected, enlarged republication. ed.), New York: Dover Pub., p. 64, ISBN 978-0-486-67870-2, retrieved 8 August 2012, Thus a planar graph, when drawn on a flat surface, either has no edge-crossings or can be redrawn without them.

harvard.edu

ui.adsabs.harvard.edu

Buhl, J.; Gautrais, J.; Sole, R.V.; Kuntz, P.; Valverde, S.; Deneubourg, J.L.; Theraulaz, G. (2004), "Efficiency and robustness in ant networks of galleries", European Physical Journal B, 42 (1): 123–129, Bibcode:2004EPJB...42..123B, doi:10.1140/epjb/e2004-00364-9, S2CID 14975826.
Giménez, Omer; Noy, Marc (2009), "Asymptotic enumeration and limit laws of planar graphs", Journal of the American Mathematical Society, 22 (2): 309–329, arXiv:math/0501269, Bibcode:2009JAMS...22..309G, doi:10.1090/s0894-0347-08-00624-3, S2CID 3353537

inria.fr

hal.inria.fr

Filotti, I. S.; Mayer, Jack N. (1980), "A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus", Proceedings of the 12th Annual ACM Symposium on Theory of Computing (PDF), pp. 236–243, doi:10.1145/800141.804671, ISBN 978-0-89791-017-0, S2CID 16345164

psu.edu

citeseerx.ist.psu.edu

McDiarmid, Colin; Steger, Angelika; Welsh, Dominic J.A. (2005), "Random planar graphs", Journal of Combinatorial Theory, Series B, 93 (2): 187–205, CiteSeerX 10.1.1.572.857, doi:10.1016/j.jctb.2004.09.007
Bonichon, N.; Gavoille, C.; Hanusse, N.; Poulalhon, D.; Schaeffer, G. (2006), "Planar Graphs, via Well-Orderly Maps and Trees", Graphs and Combinatorics, 22 (2): 185–202, CiteSeerX 10.1.1.106.7456, doi:10.1007/s00373-006-0647-2, S2CID 22639942

semanticscholar.org

api.semanticscholar.org

Buhl, J.; Gautrais, J.; Sole, R.V.; Kuntz, P.; Valverde, S.; Deneubourg, J.L.; Theraulaz, G. (2004), "Efficiency and robustness in ant networks of galleries", European Physical Journal B, 42 (1): 123–129, Bibcode:2004EPJB...42..123B, doi:10.1140/epjb/e2004-00364-9, S2CID 14975826.
Schnyder, W. (1989), "Planar graphs and poset dimension", Order, 5 (4): 323–343, doi:10.1007/BF00353652, MR 1010382, S2CID 122785359.
Bhasker, Jayaram; Sahni, Sartaj (1988), "A linear algorithm to find a rectangular dual of a planar triangulated graph", Algorithmica, 3 (1–4): 247–278, doi:10.1007/BF01762117, S2CID 2709057.
Halldórsson, M.; Kitaev, S.; Pyatkin., A. (2016), "Semi-transitive orientations and word-representable graphs" (PDF), Discr. Appl. Math., 201: 164–171, doi:10.1016/j.dam.2015.07.033, S2CID 26796091
Chen, T. Z. Q.; Kitaev, S.; Sun, B. Y. (2016), "Word-representability of face subdivisions of triangular grid graphs", Graphs and Combin, 32 (5): 1749–61, arXiv:1503.08002, doi:10.1007/s00373-016-1693-z, S2CID 43817300
Chen, T. Z. Q.; Kitaev, S.; Sun, B. Y. (2016), "Word-representability of triangulations of grid-covered cylinder graphs", Discr. Appl. Math., 213: 60–70, arXiv:1507.06749, doi:10.1016/j.dam.2016.05.025, S2CID 26987743
Giménez, Omer; Noy, Marc (2009), "Asymptotic enumeration and limit laws of planar graphs", Journal of the American Mathematical Society, 22 (2): 309–329, arXiv:math/0501269, Bibcode:2009JAMS...22..309G, doi:10.1090/s0894-0347-08-00624-3, S2CID 3353537
Bonichon, N.; Gavoille, C.; Hanusse, N.; Poulalhon, D.; Schaeffer, G. (2006), "Planar Graphs, via Well-Orderly Maps and Trees", Graphs and Combinatorics, 22 (2): 185–202, CiteSeerX 10.1.1.106.7456, doi:10.1007/s00373-006-0647-2, S2CID 22639942
Dębski, Michał; Felsner, Stefan; Micek, Piotr; Schröder, Felix (2021), "Improved Bounds for Centered Colorings", Advances in Combinatorics, arXiv:1907.04586, doi:10.19086/aic.27351, S2CID 195874032
Filotti, I. S.; Mayer, Jack N. (1980), "A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus", Proceedings of the 12th Annual ACM Symposium on Theory of Computing (PDF), pp. 236–243, doi:10.1145/800141.804671, ISBN 978-0-89791-017-0, S2CID 16345164

strath.ac.uk

strathprints.strath.ac.uk

Halldórsson, M.; Kitaev, S.; Pyatkin., A. (2016), "Semi-transitive orientations and word-representable graphs" (PDF), Discr. Appl. Math., 201: 164–171, doi:10.1016/j.dam.2015.07.033, S2CID 26796091