Universal graph (English Wikipedia)

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

refsWebsite

Global rank English rank

9doi.org

2^nd place

9ams.org

451^st place

277^th place

4arxiv.org

69^th place

59^th place

2semanticscholar.org

11^th place

8^th place

1ucsd.edu

1,933^rd place

1,342^nd place

1psu.edu

207^th place

136^th place

1renyi.hu

low place

1archive.org

6^th place

1uiuc.edu

3,087^th place

2,519^th place

ams.org

mathscinet.ams.org

Rado, R. (1964). "Universal graphs and universal functions". Acta Arithmetica. 9 (4): 331–340. doi:10.4064/aa-9-4-331-340. MR 0172268.
Rado, R. (1967). "Universal graphs". A Seminar in Graph Theory. Holt, Rinehart, and Winston. pp. 83–85. MR 0214507.
Goldstern, Martin; Kojman, Menachem (1996). "Universal arrow-free graphs". Acta Mathematica Hungarica. 1973 (4): 319–326. arXiv:math.LO/9409206. doi:10.1007/BF00052907. MR 1428038.
Cherlin, Greg; Shelah, Saharon; Shi, Niandong (1999). "Universal graphs with forbidden subgraphs and algebraic closure". Advances in Applied Mathematics. 22 (4): 454–491. arXiv:math.LO/9809202. doi:10.1006/aama.1998.0641. MR 1683298. S2CID 17529604.
Chung, F. R. K.; Graham, R. L. (1983). "On universal graphs for spanning trees" (PDF). Journal of the London Mathematical Society. 27 (2): 203–211. CiteSeerX 10.1.1.108.3415. doi:10.1112/jlms/s2-27.2.203. MR 0692525..
Babai, L.; Chung, F. R. K.; Erdős, P.; Graham, R. L.; Spencer, J. H. (1982). "On graphs which contain all sparse graphs". In Rosa, Alexander; Sabidussi, Gert; Turgeon, Jean (eds.). Theory and practice of combinatorics: a collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday (PDF). Annals of Discrete Mathematics. Vol. 12. pp. 21–26. MR 0806964.
Bhatt, Sandeep N.; Chung, Fan R. K.; Leighton, F. T.; Rosenberg, Arnold L. (1989). "Universal graphs for bounded-degree trees and planar graphs". SIAM Journal on Discrete Mathematics. 2 (2): 145–155. doi:10.1137/0402014. MR 0990447.
Chung, Fan R. K. (1990). "Separator theorems and their applications". In Korte, Bernhard; Lovász, László; Prömel, Hans Jürgen; et al. (eds.). Paths, Flows, and VLSI-Layout. Algorithms and Combinatorics. Vol. 9. Springer-Verlag. pp. 17–34. ISBN 978-0-387-52685-0. MR 1083375.
Kannan, Sampath; Naor, Moni; Rudich, Steven (1992), "Implicit representation of graphs", SIAM Journal on Discrete Mathematics, 5 (4): 596–603, doi:10.1137/0405049, MR 1186827.

archive.org

Chung, Fan R. K. (1990). "Separator theorems and their applications". In Korte, Bernhard; Lovász, László; Prömel, Hans Jürgen; et al. (eds.). Paths, Flows, and VLSI-Layout. Algorithms and Combinatorics. Vol. 9. Springer-Verlag. pp. 17–34. ISBN 978-0-387-52685-0. MR 1083375.

arxiv.org

Goldstern, Martin; Kojman, Menachem (1996). "Universal arrow-free graphs". Acta Mathematica Hungarica. 1973 (4): 319–326. arXiv:math.LO/9409206. doi:10.1007/BF00052907. MR 1428038.
Cherlin, Greg; Shelah, Saharon; Shi, Niandong (1999). "Universal graphs with forbidden subgraphs and algebraic closure". Advances in Applied Mathematics. 22 (4): 454–491. arXiv:math.LO/9809202. doi:10.1006/aama.1998.0641. MR 1683298. S2CID 17529604.
Dujmović, Vida; Esperet, Louis; Joret, Gwenaël; Gavoille, Cyril; Micek, Piotr; Morin, Pat (2021), "Adjacency Labelling for Planar Graphs (And Beyond)", Journal of the ACM, 68 (6): 1–33, arXiv:2003.04280, doi:10.1145/3477542
Czerwiński, Wojciech; Daviaud, Laure; Fijalkow, Nathanaël; Jurdziński, Marcin; Lazić, Ranko; Parys, Paweł (2018-07-27). "Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games". Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 2333–2349. arXiv:1807.10546. doi:10.1137/1.9781611975482.142. ISBN 978-1-61197-548-2. S2CID 51865783.

doi.org

Rado, R. (1964). "Universal graphs and universal functions". Acta Arithmetica. 9 (4): 331–340. doi:10.4064/aa-9-4-331-340. MR 0172268.
Goldstern, Martin; Kojman, Menachem (1996). "Universal arrow-free graphs". Acta Mathematica Hungarica. 1973 (4): 319–326. arXiv:math.LO/9409206. doi:10.1007/BF00052907. MR 1428038.
Cherlin, Greg; Shelah, Saharon; Shi, Niandong (1999). "Universal graphs with forbidden subgraphs and algebraic closure". Advances in Applied Mathematics. 22 (4): 454–491. arXiv:math.LO/9809202. doi:10.1006/aama.1998.0641. MR 1683298. S2CID 17529604.
Wu, A. Y. (1985). "Embedding of tree networks into hypercubes". Journal of Parallel and Distributed Computing. 2 (3): 238–249. doi:10.1016/0743-7315(85)90026-7.
Chung, F. R. K.; Graham, R. L. (1983). "On universal graphs for spanning trees" (PDF). Journal of the London Mathematical Society. 27 (2): 203–211. CiteSeerX 10.1.1.108.3415. doi:10.1112/jlms/s2-27.2.203. MR 0692525..
Bhatt, Sandeep N.; Chung, Fan R. K.; Leighton, F. T.; Rosenberg, Arnold L. (1989). "Universal graphs for bounded-degree trees and planar graphs". SIAM Journal on Discrete Mathematics. 2 (2): 145–155. doi:10.1137/0402014. MR 0990447.
Dujmović, Vida; Esperet, Louis; Joret, Gwenaël; Gavoille, Cyril; Micek, Piotr; Morin, Pat (2021), "Adjacency Labelling for Planar Graphs (And Beyond)", Journal of the ACM, 68 (6): 1–33, arXiv:2003.04280, doi:10.1145/3477542
Kannan, Sampath; Naor, Moni; Rudich, Steven (1992), "Implicit representation of graphs", SIAM Journal on Discrete Mathematics, 5 (4): 596–603, doi:10.1137/0405049, MR 1186827.
Czerwiński, Wojciech; Daviaud, Laure; Fijalkow, Nathanaël; Jurdziński, Marcin; Lazić, Ranko; Parys, Paweł (2018-07-27). "Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games". Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 2333–2349. arXiv:1807.10546. doi:10.1137/1.9781611975482.142. ISBN 978-1-61197-548-2. S2CID 51865783.

psu.edu

citeseerx.ist.psu.edu

Chung, F. R. K.; Graham, R. L. (1983). "On universal graphs for spanning trees" (PDF). Journal of the London Mathematical Society. 27 (2): 203–211. CiteSeerX 10.1.1.108.3415. doi:10.1112/jlms/s2-27.2.203. MR 0692525..

renyi.hu

Babai, L.; Chung, F. R. K.; Erdős, P.; Graham, R. L.; Spencer, J. H. (1982). "On graphs which contain all sparse graphs". In Rosa, Alexander; Sabidussi, Gert; Turgeon, Jean (eds.). Theory and practice of combinatorics: a collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday (PDF). Annals of Discrete Mathematics. Vol. 12. pp. 21–26. MR 0806964.

semanticscholar.org

api.semanticscholar.org

Cherlin, Greg; Shelah, Saharon; Shi, Niandong (1999). "Universal graphs with forbidden subgraphs and algebraic closure". Advances in Applied Mathematics. 22 (4): 454–491. arXiv:math.LO/9809202. doi:10.1006/aama.1998.0641. MR 1683298. S2CID 17529604.
Czerwiński, Wojciech; Daviaud, Laure; Fijalkow, Nathanaël; Jurdziński, Marcin; Lazić, Ranko; Parys, Paweł (2018-07-27). "Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games". Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 2333–2349. arXiv:1807.10546. doi:10.1137/1.9781611975482.142. ISBN 978-1-61197-548-2. S2CID 51865783.

ucsd.edu

math.ucsd.edu

Chung, F. R. K.; Graham, R. L. (1983). "On universal graphs for spanning trees" (PDF). Journal of the London Mathematical Society. 27 (2): 203–211. CiteSeerX 10.1.1.108.3415. doi:10.1112/jlms/s2-27.2.203. MR 0692525..

uiuc.edu

math.uiuc.edu

Sumner's Universal Tournament Conjecture, Douglas B. West, retrieved 2010-09-17.