Sign In

Login

Password

Forgot Password ? Sign Up

Critical graph (English Wikipedia)

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

refsWebsite
Global rank English rank
4doi.org
2nd place
2nd place
1tue.nl
9,054th place
6,363rd place
1psu.edu
207th place
136th place
1harvard.edu
18th place
17th place
1semanticscholar.org
11th place
8th place
1ams.org
451st place
277th place

ams.org

mathscinet.ams.org

doi.org

  • de Bruijn, N. G.; Erdős, P. (1951), "A colour problem for infinite graphs and a problem in the theory of relations", Nederl. Akad. Wetensch. Proc. Ser. A, 54: 371–373, CiteSeerX 10.1.1.210.6623, doi:10.1016/S1385-7258(51)50053-7. (Indag. Math. 13.)
  • Brooks, R. L. (1941), "On colouring the nodes of a network", Proceedings of the Cambridge Philosophical Society, 37 (2): 194–197, Bibcode:1941PCPS...37..194B, doi:10.1017/S030500410002168X, S2CID 209835194
  • Dirac, G. A. (1957), "A theorem of R. L. Brooks and a conjecture of H. Hadwiger", Proceedings of the London Mathematical Society, 7 (1): 161–195, doi:10.1112/plms/s3-7.1.161
  • Stehlík, Matěj (2003), "Critical graphs with connected complements", Journal of Combinatorial Theory, Series B, 89 (2): 189–194, doi:10.1016/S0095-8956(03)00069-8, MR 2017723

harvard.edu

ui.adsabs.harvard.edu

psu.edu

citeseerx.ist.psu.edu

  • de Bruijn, N. G.; Erdős, P. (1951), "A colour problem for infinite graphs and a problem in the theory of relations", Nederl. Akad. Wetensch. Proc. Ser. A, 54: 371–373, CiteSeerX 10.1.1.210.6623, doi:10.1016/S1385-7258(51)50053-7. (Indag. Math. 13.)

semanticscholar.org

api.semanticscholar.org

tue.nl

research.tue.nl

  • de Bruijn, N. G.; Erdős, P. (1951), "A colour problem for infinite graphs and a problem in the theory of relations", Nederl. Akad. Wetensch. Proc. Ser. A, 54: 371–373, CiteSeerX 10.1.1.210.6623, doi:10.1016/S1385-7258(51)50053-7. (Indag. Math. 13.)