Sign In

Login

Password

Forgot Password ? Sign Up

Matchstick graph (English Wikipedia)

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

refsWebsite
Global rank English rank
12arxiv.org
69th place
59th place
11doi.org
2nd place
2nd place
7ams.org
451st place
277th place
4semanticscholar.org
11th place
8th place
2wolfram.com
513th place
537th place
1worldcat.org
5th place
5th place
1brown.edu
2,481st place
1,558th place
1psu.edu
207th place
136th place
1monsite-orange.fr
low place
low place

ams.org

mathscinet.ams.org

  • Gervacio, Severino V.; Lim, Yvette F.; Maehara, Hiroshi (2008), "Planar unit-distance graphs having planar unit-distance complement", Discrete Mathematics, 308 (10): 1973–1984, doi:10.1016/j.disc.2007.04.050, MR 2394465
  • Gerbracht, Eberhard H.-A. (2011), "Symbol-crunching the Harborth graph", Advances in Applied Mathematics, 47 (2): 276–281, doi:10.1016/j.aam.2010.09.003, MR 2803803. For additional details see the earlier preprint in Gerbracht, Eberhard H.-A. (2006), "Minimal Polynomials for the Coordinates of the Harborth Graph", arXiv:math/0609360{{cite arXiv}}: CS1 maint: overridden setting (link).
  • Kurz, Sascha; Pinchasi, Rom (2011), "Regular matchstick graphs", American Mathematical Monthly, 118 (3): 264–267, arXiv:1401.4372, doi:10.4169/amer.math.monthly.118.03.264, MR 2800336, S2CID 866740.
  • Lavollée, Jérémy; Swanepoel, Konrad J. (2023), "The number of small-degree vertices in matchstick graphs", The Australasian Journal of Combinatorics, 85: 92–99, arXiv:2206.03956, MR 4515475
  • Kurz, Sascha (2011), "Fast recognition of planar non unit distance graphs", Geombinatorics, 21 (1): 25–33, arXiv:1401.4375, MR 2858668.
  • Itai, Alon; Papadimitriou, Christos H.; Szwarcfiter, Jayme Luiz (1982), "Hamilton paths in grid graphs", SIAM Journal on Computing, 11 (4): 676–686, CiteSeerX 10.1.1.383.1078, doi:10.1137/0211056, MR 0677661.
  • Carlson, Josiah; Eppstein, David (2006), "Trees with convex faces and optimal angles", in Kaufmann, Michael; Wagner, Dorothea (eds.), Proceedings of the 14th International Symposium on Graph Drawing, Lecture Notes in Computer Science, vol. 4372, Springer-Verlag, pp. 77–88, arXiv:cs.CG/0607113, doi:10.1007/978-3-540-70904-6_9, ISBN 978-3-540-70903-9, MR 2393907, S2CID 12598338.

arxiv.org

  • Gerbracht, Eberhard H.-A. (2011), "Symbol-crunching the Harborth graph", Advances in Applied Mathematics, 47 (2): 276–281, doi:10.1016/j.aam.2010.09.003, MR 2803803. For additional details see the earlier preprint in Gerbracht, Eberhard H.-A. (2006), "Minimal Polynomials for the Coordinates of the Harborth Graph", arXiv:math/0609360{{cite arXiv}}: CS1 maint: overridden setting (link).
  • Kurz, Sascha; Pinchasi, Rom (2011), "Regular matchstick graphs", American Mathematical Monthly, 118 (3): 264–267, arXiv:1401.4372, doi:10.4169/amer.math.monthly.118.03.264, MR 2800336, S2CID 866740.
  • Winkler, Mike; Dinkelacker, Peter; Vogel, Stefan (2017), "New minimal (4; n)-regular matchstick graphs", Geombinatorics, 27: 26–44, arXiv:1604.07134.
  • Winkler, Mike; Dinkelacker, Peter; Vogel, Stefan (2017), On the existence of 4-regular matchstick graphs, arXiv:1705.00293.
  • Lavollée, Jérémy; Swanepoel, Konrad J. (2023), "The number of small-degree vertices in matchstick graphs", The Australasian Journal of Combinatorics, 85: 92–99, arXiv:2206.03956, MR 4515475
  • Kurz, Sascha; Mazzuoccolo, Giuseppe (2010), "3-regular matchstick graphs with given girth", Geombinatorics, 19: 156–175, arXiv:1401.4360.
  • Winkler, Mike; Dinkelacker, Peter; Vogel, Stefan (2020), "A 3-regular matchstick graph of girth 5 consisting of 54 vertices", Geombinatorics, 29: 116–121, arXiv:1903.04304.
  • Lavollée, Jérémy; Swanepoel, Konrad (August 18, 2023), "A Tight Bound for the Number of Edges of Matchstick Graphs", Discrete & Computational Geometry, arXiv:2209.09800, doi:10.1007/s00454-023-00530-z, ISSN 1432-0444
  • Kurz, Sascha (2011), "Fast recognition of planar non unit distance graphs", Geombinatorics, 21 (1): 25–33, arXiv:1401.4375, MR 2858668.
  • Salvia, Raffaele (2013), "A catalog for matchstick graphs", arXiv:1303.5965 [math.CO]{{cite arXiv}}: CS1 maint: overridden setting (link)
  • Carlson, Josiah; Eppstein, David (2006), "Trees with convex faces and optimal angles", in Kaufmann, Michael; Wagner, Dorothea (eds.), Proceedings of the 14th International Symposium on Graph Drawing, Lecture Notes in Computer Science, vol. 4372, Springer-Verlag, pp. 77–88, arXiv:cs.CG/0607113, doi:10.1007/978-3-540-70904-6_9, ISBN 978-3-540-70903-9, MR 2393907, S2CID 12598338.
  • Eppstein, David; Wortman, Kevin A. (2011), "Optimal angular resolution for face-symmetric drawings", Journal of Graph Algorithms and Applications, 15 (4): 551–564, arXiv:0907.5474, doi:10.7155/jgaa.00238, S2CID 10356432.

brown.edu

cs.brown.edu

doi.org

  • Gervacio, Severino V.; Lim, Yvette F.; Maehara, Hiroshi (2008), "Planar unit-distance graphs having planar unit-distance complement", Discrete Mathematics, 308 (10): 1973–1984, doi:10.1016/j.disc.2007.04.050, MR 2394465
  • Gerbracht, Eberhard H.-A. (2011), "Symbol-crunching the Harborth graph", Advances in Applied Mathematics, 47 (2): 276–281, doi:10.1016/j.aam.2010.09.003, MR 2803803. For additional details see the earlier preprint in Gerbracht, Eberhard H.-A. (2006), "Minimal Polynomials for the Coordinates of the Harborth Graph", arXiv:math/0609360{{cite arXiv}}: CS1 maint: overridden setting (link).
  • Kurz, Sascha; Pinchasi, Rom (2011), "Regular matchstick graphs", American Mathematical Monthly, 118 (3): 264–267, arXiv:1401.4372, doi:10.4169/amer.math.monthly.118.03.264, MR 2800336, S2CID 866740.
  • Lavollée, Jérémy; Swanepoel, Konrad (August 18, 2023), "A Tight Bound for the Number of Edges of Matchstick Graphs", Discrete & Computational Geometry, arXiv:2209.09800, doi:10.1007/s00454-023-00530-z, ISSN 1432-0444
  • Eades, Peter; Wormald, Nicholas C. (1990), "Fixed edge-length graph drawing is NP-hard", Discrete Applied Mathematics, 28 (2): 111–134, doi:10.1016/0166-218X(90)90110-X.
  • Cabello, Sergio; Demaine, Erik D.; Rote, Günter (2007), "Planar embeddings of graphs with specified edge lengths" (PDF), Journal of Graph Algorithms and Applications, 11 (1): 259–276, doi:10.7155/jgaa.00145.
  • Abel, Zachary; Demaine, Erik D.; Demaine, Martin L.; Eisenstat, Sarah; Lynch, Jayson; Schardl, Tao B. (2016), "Who needs crossings? Hardness of plane graph rigidity", in Fekete, Sándor; Lubiw, Anna (eds.), 32nd International Symposium on Computational Geometry (SoCG 2016), Leibniz International Proceedings in Informatics (LIPIcs), vol. 51, Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 3:1–3:15, doi:10.4230/LIPIcs.SoCG.2016.3, ISBN 978-3-95977-009-5.
  • Itai, Alon; Papadimitriou, Christos H.; Szwarcfiter, Jayme Luiz (1982), "Hamilton paths in grid graphs", SIAM Journal on Computing, 11 (4): 676–686, CiteSeerX 10.1.1.383.1078, doi:10.1137/0211056, MR 0677661.
  • Fruchterman, Thomas M. J.; Reingold, Edward M. (1991), "Graph Drawing by Force-Directed Placement", Software: Practice and Experience, 21 (11), Wiley: 1129–1164, doi:10.1002/spe.4380211102, S2CID 31468174.
  • Carlson, Josiah; Eppstein, David (2006), "Trees with convex faces and optimal angles", in Kaufmann, Michael; Wagner, Dorothea (eds.), Proceedings of the 14th International Symposium on Graph Drawing, Lecture Notes in Computer Science, vol. 4372, Springer-Verlag, pp. 77–88, arXiv:cs.CG/0607113, doi:10.1007/978-3-540-70904-6_9, ISBN 978-3-540-70903-9, MR 2393907, S2CID 12598338.
  • Eppstein, David; Wortman, Kevin A. (2011), "Optimal angular resolution for face-symmetric drawings", Journal of Graph Algorithms and Applications, 15 (4): 551–564, arXiv:0907.5474, doi:10.7155/jgaa.00238, S2CID 10356432.

monsite-orange.fr

alexis.vaisse.monsite-orange.fr

psu.edu

citeseerx.ist.psu.edu

semanticscholar.org

api.semanticscholar.org

wolfram.com

mathworld.wolfram.com

worldcat.org

search.worldcat.org