Sign In

Login

Password

Forgot Password ? Sign Up

Folkman graph (English Wikipedia)

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

refsWebsite
Global rank English rank
9doi.org
2nd place
2nd place
7ams.org
451st place
277th place
3arxiv.org
69th place
59th place
2amc-journal.eu
low place
low place
1bgu.ac.il
low place
low place
1wolfram.com
513th place
537th place
1handle.net
102nd place
76th place
1semanticscholar.org
11th place
8th place

amc-journal.eu

ams.org

mathscinet.ams.org

  • Boesch, F.; Tindell, R. (1984), "Circulants and their connectivities", Journal of Graph Theory, 8 (4): 487–499, doi:10.1002/jgt.3190080406, MR 0766498
  • Alam, Jawaherul Md.; Bekos, Michael A.; Dujmović, Vida; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey (2021), "On dispersable book embeddings", Theoretical Computer Science, 861: 1–22, arXiv:1803.10030, doi:10.1016/j.tcs.2021.01.035, MR 4221556
  • Potočnik, Primož; Wilson, Stephen E. (2014), "Linking rings structures and tetravalent semisymmetric graphs", Ars Mathematica Contemporanea, 7 (2): 341–352, doi:10.26493/1855-3974.311.4a8, MR 3240442
  • Potočnik, Primož; Wilson, Steve (2007), "Tetravalent edge-transitive graphs of girth at most 4", Journal of Combinatorial Theory, Series B, 97 (2): 217–236, doi:10.1016/j.jctb.2006.03.007, MR 2290322
  • Galvin, Fred (1995), "The list chromatic index of a bipartite multigraph", Journal of Combinatorial Theory, Series B, 63 (1): 153–158, doi:10.1006/jctb.1995.1011, MR 1309363
  • Conder, Marston; Stokes, Klara (2019), "New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces", Ars Mathematica Contemporanea, 17 (1): 1–35, doi:10.26493/1855-3974.1800.40c, hdl:2292/57926, MR 3992757
  • Brinkmann, Gunnar (2022), "A practical algorithm for the computation of the genus", Ars Mathematica Contemporanea, 22 (4), Paper No. 1, arXiv:2005.08243, doi:10.26493/1855-3974.2320.c2d, MR 4498572, S2CID 218674244

arxiv.org

bgu.ac.il

aranne5.bgu.ac.il

doi.org

  • Boesch, F.; Tindell, R. (1984), "Circulants and their connectivities", Journal of Graph Theory, 8 (4): 487–499, doi:10.1002/jgt.3190080406, MR 0766498
  • Folkman, J. (1967), "Regular line-symmetric graphs", Journal of Combinatorial Theory, 3 (3): 215–232, doi:10.1016/S0021-9800(67)80069-3
  • Alam, Jawaherul Md.; Bekos, Michael A.; Dujmović, Vida; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey (2021), "On dispersable book embeddings", Theoretical Computer Science, 861: 1–22, arXiv:1803.10030, doi:10.1016/j.tcs.2021.01.035, MR 4221556
  • Potočnik, Primož; Wilson, Stephen E. (2014), "Linking rings structures and tetravalent semisymmetric graphs", Ars Mathematica Contemporanea, 7 (2): 341–352, doi:10.26493/1855-3974.311.4a8, MR 3240442
  • Potočnik, Primož; Wilson, Steve (2007), "Tetravalent edge-transitive graphs of girth at most 4", Journal of Combinatorial Theory, Series B, 97 (2): 217–236, doi:10.1016/j.jctb.2006.03.007, MR 2290322
  • Galvin, Fred (1995), "The list chromatic index of a bipartite multigraph", Journal of Combinatorial Theory, Series B, 63 (1): 153–158, doi:10.1006/jctb.1995.1011, MR 1309363
  • Heule, Marijn; Szeider, Stefan (2015), "A SAT approach to clique-width", ACM Transactions on Computational Logic, 16 (3): 24:1–24:27, arXiv:1304.5498, doi:10.1145/2736696
  • Conder, Marston; Stokes, Klara (2019), "New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces", Ars Mathematica Contemporanea, 17 (1): 1–35, doi:10.26493/1855-3974.1800.40c, hdl:2292/57926, MR 3992757
  • Brinkmann, Gunnar (2022), "A practical algorithm for the computation of the genus", Ars Mathematica Contemporanea, 22 (4), Paper No. 1, arXiv:2005.08243, doi:10.26493/1855-3974.2320.c2d, MR 4498572, S2CID 218674244

handle.net

hdl.handle.net

semanticscholar.org

api.semanticscholar.org

wolfram.com

mathworld.wolfram.com