List coloring (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "List coloring" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

4semanticscholar.org

11^th place

8^th place

3web.archive.org

1^st place

2uri.edu

8,176^th place

5,290^th place

1ams.org

451^st place

277^th place

1math-inst.hu

low place

1psu.edu

207^th place

136^th place

1arxiv.org

69^th place

59^th place

1uib.no

4,170^th place

3,980^th place

1handle.net

102^nd place

76^th place

ams.org

mathscinet.ams.org

Gravier, Sylvain (1996), "A Hajós-like theorem for list coloring", Discrete Mathematics, 152 (1–3): 299–302, doi:10.1016/0012-365X(95)00350-6, MR 1388650.

arxiv.org

Gutner, Shai (1996), "The complexity of planar graph choosability", Discrete Mathematics, 159 (1): 119–130, arXiv:0802.2668, doi:10.1016/0012-365X(95)00104-5, S2CID 1392057.

doi.org

Gravier, Sylvain (1996), "A Hajós-like theorem for list coloring", Discrete Mathematics, 152 (1–3): 299–302, doi:10.1016/0012-365X(95)00350-6, MR 1388650.
Thomassen, Carsten (1994), "Every planar graph is 5-choosable", Journal of Combinatorial Theory, Series B, 62: 180–181, doi:10.1006/jctb.1994.1062
Alon, Noga; Tarsi, Michael (1992), "Colorings and orientations of graphs", Combinatorica, 12 (2): 125–134, CiteSeerX 10.1.1.106.9928, doi:10.1007/BF01204715, S2CID 45528500
Gutner, Shai (1996), "The complexity of planar graph choosability", Discrete Mathematics, 159 (1): 119–130, arXiv:0802.2668, doi:10.1016/0012-365X(95)00104-5, S2CID 1392057.
Gutner, Shai; Tarsi, Michael (2009), "Some results on (a:b)-choosability", Discrete Mathematics, 309 (8): 2260–2270, doi:10.1016/j.disc.2008.04.061
Wang, Wei; Liu, Xin (2005), "List-coloring based channel allocation for open-spectrum wireless networks", 2005 IEEE 62nd Vehicular Technology Conference (VTC 2005-Fall), vol. 1, pp. 690–694, doi:10.1109/VETECF.2005.1558001, ISBN 0-7803-9152-7, S2CID 14952297.
Garg, N.; Papatriantafilou, M.; Tsigas, P. (1996), "Distributed list coloring: how to dynamically allocate frequencies to mobile base stations", Eighth IEEE Symposium on Parallel and Distributed Processing, pp. 18–25, doi:10.1109/SPDP.1996.570312, hdl:21.11116/0000-0001-1AE6-F, ISBN 0-8186-7683-3, S2CID 3319306.

handle.net

hdl.handle.net

Garg, N.; Papatriantafilou, M.; Tsigas, P. (1996), "Distributed list coloring: how to dynamically allocate frequencies to mobile base stations", Eighth IEEE Symposium on Parallel and Distributed Processing, pp. 18–25, doi:10.1109/SPDP.1996.570312, hdl:21.11116/0000-0001-1AE6-F, ISBN 0-8186-7683-3, S2CID 3319306.

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 2008-11-10

psu.edu

citeseerx.ist.psu.edu

Alon, Noga; Tarsi, Michael (1992), "Colorings and orientations of graphs", Combinatorica, 12 (2): 125–134, CiteSeerX 10.1.1.106.9928, doi:10.1007/BF01204715, S2CID 45528500

semanticscholar.org

api.semanticscholar.org

Alon, Noga; Tarsi, Michael (1992), "Colorings and orientations of graphs", Combinatorica, 12 (2): 125–134, CiteSeerX 10.1.1.106.9928, doi:10.1007/BF01204715, S2CID 45528500
Gutner, Shai (1996), "The complexity of planar graph choosability", Discrete Mathematics, 159 (1): 119–130, arXiv:0802.2668, doi:10.1016/0012-365X(95)00104-5, S2CID 1392057.
Wang, Wei; Liu, Xin (2005), "List-coloring based channel allocation for open-spectrum wireless networks", 2005 IEEE 62nd Vehicular Technology Conference (VTC 2005-Fall), vol. 1, pp. 690–694, doi:10.1109/VETECF.2005.1558001, ISBN 0-7803-9152-7, S2CID 14952297.
Garg, N.; Papatriantafilou, M.; Tsigas, P. (1996), "Distributed list coloring: how to dynamically allocate frequencies to mobile base stations", Eighth IEEE Symposium on Parallel and Distributed Processing, pp. 18–25, doi:10.1109/SPDP.1996.570312, hdl:21.11116/0000-0001-1AE6-F, ISBN 0-8186-7683-3, S2CID 3319306.

uib.no

ii.uib.no

Heggernes, Pinar; Golovach, Petr (2009), "Choosability of P₅-free graphs" (PDF), Mathematical Foundations of Computer Science, Lecture Notes on Computer Science, vol. 5734, Springer-Verlag, pp. 382–391

uri.edu

math.uri.edu

Eaton, Nancy (2003), "On two short proofs about list coloring - Part 1" (PDF), Talk, archived from the original (PDF) on August 29, 2017, retrieved May 29, 2010
Eaton, Nancy (2003), "On two short proofs about list coloring - Part 2" (PDF), Talk, archived from the original (PDF) on August 30, 2017, retrieved May 29, 2010

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 2008-11-10
Eaton, Nancy (2003), "On two short proofs about list coloring - Part 1" (PDF), Talk, archived from the original (PDF) on August 29, 2017, retrieved May 29, 2010
Eaton, Nancy (2003), "On two short proofs about list coloring - Part 2" (PDF), Talk, archived from the original (PDF) on August 30, 2017, retrieved May 29, 2010