Dinitz conjecture (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Dinitz conjecture" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

1web.archive.org

1^st place

1^st place

low place

low place

69^th place

59^th place

26^th place

20^th place

451^st place

277^th place

415^th place

327^th place

ams.org

mathscinet.ams.org

Gravier, Sylvain; Maffray, Frédéric (2004). "On the choice number of claw-free perfect graphs". Discrete Mathematics. 276 (1–3): 211–218. doi:10.1016/S0012-365X(03)00292-9. MR 2046636.

arxiv.org

Zeilberger, D. (1996). "The method of undetermined generalization and specialization illustrated with Fred Galvin's amazing proof of the Dinitz conjecture". American Mathematical Monthly. 103 (3): 233–239. arXiv:math/9506215. doi:10.2307/2975373. JSTOR 2975373.

doi.org

F. Galvin (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.
Zeilberger, D. (1996). "The method of undetermined generalization and specialization illustrated with Fred Galvin's amazing proof of the Dinitz conjecture". American Mathematical Monthly. 103 (3): 233–239. arXiv:math/9506215. doi:10.2307/2975373. JSTOR 2975373.
Gravier, Sylvain; Maffray, Frédéric (2004). "On the choice number of claw-free perfect graphs". Discrete Mathematics. 276 (1–3): 211–218. doi:10.1016/S0012-365X(03)00292-9. MR 2046636.
Chow, T. Y. (1995). "On the Dinitz conjecture and related conjectures" (PDF). Discrete Mathematics. 145 (1–3): 73–82. doi:10.1016/0012-365X(94)00055-N.

jstor.org

Zeilberger, D. (1996). "The method of undetermined generalization and specialization illustrated with Fred Galvin's amazing proof of the Dinitz conjecture". American Mathematical Monthly. 103 (3): 233–239. arXiv:math/9506215. doi:10.2307/2975373. JSTOR 2975373.

math-inst.hu

Erdős, P.; Rubin, A. L.; Taylor, H. (1979). "Choosability in graphs". Proc. West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata (PDF). Congressus Numerantium. Vol. 26. pp. 125–157. Archived from the original (PDF) on 2016-03-09. Retrieved 2017-04-22.

mit.edu

math.mit.edu

Chow, T. Y. (1995). "On the Dinitz conjecture and related conjectures" (PDF). Discrete Mathematics. 145 (1–3): 73–82. doi:10.1016/0012-365X(94)00055-N.

web.archive.org

Erdős, P.; Rubin, A. L.; Taylor, H. (1979). "Choosability in graphs". Proc. West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata (PDF). Congressus Numerantium. Vol. 26. pp. 125–157. Archived from the original (PDF) on 2016-03-09. Retrieved 2017-04-22.