Dinitz-probléma (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Dinitz-probléma" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

2^nd place

8^th place

2web.archive.org

1^st place

1^st place

low place

low place

low place

low place

6^th place

14^th place

451^st place

1,456^th place

415^th place

753^rd place

ams.org

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

archive.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. o. DOI:10.2307/2975373.

doi.org

dx.doi.org

F. Galvin (1995). „The list chromatic index of a bipartite multigraph” (PDF). Journal of Combinatorial Theory 63 (1), 153–158. o. DOI:10.1006/jctb.1995.1011. ^{[halott link]}
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. o. DOI:10.2307/2975373.
Gravier, Sylvain, Frédéric Maffray (2004). „On the choice number of claw-free perfect graphs”. Discrete Mathematics 276 (1-3), 211–218. o. 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. o. DOI:10.1016/0012-365X(94)00055-N.

els-cdn.com

ac.els-cdn.com

F. Galvin (1995). „The list chromatic index of a bipartite multigraph” (PDF). Journal of Combinatorial Theory 63 (1), 153–158. o. DOI:10.1006/jctb.1995.1011. ^{[halott link]}

math-inst.hu

Erdős, P.; A. L. Rubin, H. Taylor (1979). „Proc. West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata” (PDF). Choosability in graphs (Congressus Numerantium) 26: 125–157. [2016. március 9-i dátummal az eredetiből archiválva]. Hozzáférés: 2018. március 17.

mit.edu

math.mit.edu

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

web.archive.org

Erdős, P.; A. L. Rubin, H. Taylor (1979). „Proc. West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata” (PDF). Choosability in graphs (Congressus Numerantium) 26: 125–157. [2016. március 9-i dátummal az eredetiből archiválva]. Hozzáférés: 2018. március 17.
F. Galvin (1995). „The list chromatic index of a bipartite multigraph” (PDF). Journal of Combinatorial Theory 63 (1), 153–158. o. DOI:10.1006/jctb.1995.1011. ^{[halott link]}