Edge coloring (English Wikipedia)

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

refsWebsite

Global rank English rank

26doi.org

2^nd place

15ams.org

451^st place

277^th place

9semanticscholar.org

11^th place

8^th place

5arxiv.org

69^th place

59^th place

3harvard.edu

18^th place

17^th place

2jstor.org

26^th place

20^th place

1web.archive.org

1^st place

1handle.net

102^nd place

76^th place

1uni-goettingen.de

2,594^th place

2,546^th place

1renyi.hu

low place

1acm.org

1,185^th place

840^th place

1cmu.edu

1,564^th place

1,028^th place

1umanitoba.ca

8,208^th place

5,328^th place

1books.google.com

3^rd place

1sunysb.edu

9,785^th place

9,347^th place

acm.org (Global: 1,185^th place; English: 840^th place)

portal.acm.org

Bahmani, Mehta & Motwani (2010). Bahmani, Bahman; Mehta, Aranyak; Motwani, Rajeev (2010), "A 1.43-competitive online graph edge coloring algorithm in the random order arrival model", Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '10), Society for Industrial and Applied Mathematics, pp. 31–39, ISBN 9780898716986.

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Tait (1880); Appel & Haken (1976). Tait, P. G. (1880), "Remarks on the colourings of maps", Proc. R. Soc. Edinburgh, 10: 729, doi:10.1017/S0370164600044643. Appel, K.; Haken, W. (1976), "Every planar map is four colorable", Bulletin of the American Mathematical Society, 82 (5): 711–712, doi:10.1090/S0002-9904-1976-14122-5, MR 0424602.
Goldberg (1973); Andersen (1977); Seymour (1979). Goldberg, M. K. (1973), "Multigraphs with a chromatic index that is nearly maximal", Diskret. Analiz. (23): 3–7, 72, MR 0354429. As cited by Chen, Yu & Zang (2011). Andersen, Lars Døvling (1977), "On edge-colourings of graphs", Mathematica Scandinavica, 40 (2): 161–175, doi:10.7146/math.scand.a-11685, MR 0465922. As cited by Chen, Yu & Zang (2011). Seymour, P. D. (1979), "On multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte", Proceedings of the London Mathematical Society, Third Series, 38 (3): 423–460, doi:10.1112/plms/s3-38.3.423, MR 0532981.
Chen, Yu & Zang (2011). Chen, Guantao; Yu, Xingxing; Zang, Wenan (2011), "Approximating the chromatic index of multigraphs", Journal of Combinatorial Optimization, 21 (2): 219–246, doi:10.1007/s10878-009-9232-y, MR 2770056, S2CID 169162.
Schwenk (1989). Schwenk, Allen J. (1989), "Enumeration of Hamiltonian cycles in certain generalized Petersen graphs", Journal of Combinatorial Theory, Series B, 47 (1): 53–59, doi:10.1016/0095-8956(89)90064-6, MR 1007713.
Bosák (1972). Bosák, Juraj (1972), "Chromatic index of finite and infinite graphs", Czechoslovak Mathematical Journal, 22 (97): 272–290, doi:10.21136/CMJ.1972.101098, MR 0309777.
Akiyama, Exoo & Harary (1980); Habib & Péroche (1982); Horák & Niepel (1982). Habib, M.; Péroche, B. (1982), "Some problems about linear arboricity", Discrete Mathematics, 41 (2): 219–220, doi:10.1016/0012-365X(82)90209-6, MR 0676882. Horák, Peter; Niepel, Ľudovít (1982), "A short proof of a linear arboricity theorem for cubic graphs", Acta Mathematica Universitatis Comenianae, 40/41: 275–277, MR 0686983.
Nash-Williams (1964). Nash-Williams, C. St. J. A. (1964), "Decomposition of finite graphs into forests", Journal of the London Mathematical Society, Second Series, 39: 12, doi:10.1112/jlms/s1-39.1.12, MR 0161333
Gabow & Westermann (1992). Gabow, Harold N.; Westermann, Herbert H. (1992), "Forests, frames, and games: algorithms for matroid sums and applications", Algorithmica, 7 (5–6): 465–497, doi:10.1007/BF01758774, MR 1154585, S2CID 40358357.
Bosák & Nešetřil (1976). Bosák, Juraj; Nešetřil, Jaroslav (1976), "Complete and pseudocomplete colourings of a graph", Matematicky Časopis Slovenskej Akadémie Vied, 26 (3): 171–184, MR 0439672.
Fouquet & Jolivet (1983); Mahdian (2002); Frieze, Krivelevich & Sudakov (2005); Cranston (2006). Fouquet, J.-L.; Jolivet, J.-L. (1983), "Strong edge-colorings of graphs and applications to multi- $k$ -gons", Ars Combinatoria, 16 (A): 141–150, MR 0737086. Mahdian, Mohammad (2002), "On the computational complexity of strong edge coloring", Discrete Applied Mathematics, 118 (3): 239–248, doi:10.1016/S0166-218X(01)00237-2, MR 1892971. Frieze, Alan M.; Krivelevich, Michael; Sudakov, Benny (2005), "The strong chromatic index of random graphs" (PDF), SIAM Journal on Discrete Mathematics, 19 (3): 719–727 (electronic), doi:10.1137/S0895480104445757, MR 2191290. Cranston, Daniel W. (2006), "Strong edge-coloring of graphs with maximum degree 4 using 22 colors", Discrete Mathematics, 306 (21): 2772–2778, arXiv:math/0601623, Bibcode:2006math......1623C, doi:10.1016/j.disc.2006.03.053, MR 2264374, S2CID 1097275.
Alon, Sudakov & Zaks (2001); Muthu, Narayanan & Subramanian (2007). Alon, Noga; Sudakov, Benny; Zaks, Ayal (2001), "Acyclic edge colorings of graphs", Journal of Graph Theory, 37 (3): 157–167, doi:10.1002/jgt.1010, MR 1837021. Muthu, Rahul; Narayanan, N.; Subramanian, C. R. (2007), "Improved bounds on acyclic edge colouring", Discrete Mathematics, 307 (23): 3063–3069, doi:10.1016/j.disc.2007.03.006, MR 2371078.
Fiamčik (1978); Alon, Sudakov & Zaks (2001) Fiamčik, J. (1978), "The acyclic chromatic class of a graph", Math. Slovaca, 28: 139–145. Alon, Noga; Sudakov, Benny; Zaks, Ayal (2001), "Acyclic edge colorings of graphs", Journal of Graph Theory, 37 (3): 157–167, doi:10.1002/jgt.1010, MR 1837021.
Alon, Sudakov & Zaks (2001). Alon, Noga; Sudakov, Benny; Zaks, Ayal (2001), "Acyclic edge colorings of graphs", Journal of Graph Theory, 37 (3): 157–167, doi:10.1002/jgt.1010, MR 1837021.
Williamson et al. (1997). Williamson, D. P.; Hall, L. A.; Hoogeveen, J. A.; Hurkens, C. A. J.; Lenstra, J. K.; Sevast'janov, S. V.; Shmoys, D. B. (1997), "Short shop schedules", Operations Research, 45 (2): 288–294, doi:10.1287/opre.45.2.288, JSTOR 171745, MR 1644998.
Erlebach & Jansen (2001). Erlebach, Thomas; Jansen, Klaus (2001), "The complexity of path coloring and call scheduling", Theoretical Computer Science, 255 (1–2): 33–50, doi:10.1016/S0304-3975(99)00152-8, MR 1819065.

arxiv.org (Global: 69^th place; English: 59^th place)

Eppstein (2013). Eppstein, David (2013), "The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing", Journal of Graph Algorithms and Applications, 17 (1): 35–55, arXiv:0709.4087, doi:10.7155/jgaa.00283, S2CID 2716392.
Fouquet & Jolivet (1983); Mahdian (2002); Frieze, Krivelevich & Sudakov (2005); Cranston (2006). Fouquet, J.-L.; Jolivet, J.-L. (1983), "Strong edge-colorings of graphs and applications to multi- $k$ -gons", Ars Combinatoria, 16 (A): 141–150, MR 0737086. Mahdian, Mohammad (2002), "On the computational complexity of strong edge coloring", Discrete Applied Mathematics, 118 (3): 239–248, doi:10.1016/S0166-218X(01)00237-2, MR 1892971. Frieze, Alan M.; Krivelevich, Michael; Sudakov, Benny (2005), "The strong chromatic index of random graphs" (PDF), SIAM Journal on Discrete Mathematics, 19 (3): 719–727 (electronic), doi:10.1137/S0895480104445757, MR 2191290. Cranston, Daniel W. (2006), "Strong edge-coloring of graphs with maximum degree 4 using 22 colors", Discrete Mathematics, 306 (21): 2772–2778, arXiv:math/0601623, Bibcode:2006math......1623C, doi:10.1016/j.disc.2006.03.053, MR 2264374, S2CID 1097275.
Cai et al. (2014). Cai, X. S.; Perarnau, G.; Reed, B. A.; Watts, A. B. (2014), "Acyclic edge colourings of graphs with large girth", Random Structures & Algorithms, 50 (4): 511–533, arXiv:1411.3047, doi:10.1002/rsa.20695, S2CID 7727097.
Eppstein (2010). Eppstein, David (2010), "Regular labelings and geometric structures", Proc. 22nd Canadian Conference on Computational Geometry (CCCG 2010) (PDF), University of Manitoba, arXiv:1007.0221, Bibcode:2010arXiv1007.0221E.
Chudnovsky, Edwards & Seymour (2015). Chudnovsky, Maria; Edwards, Katherine; Seymour, Paul (November 2015), "Edge-colouring eight-regular planar graphs", Journal of Combinatorial Theory, Series B, 115: 303–338, arXiv:1209.1176, doi:10.1016/j.jctb.2015.05.002.

books.google.com (Global: 3^rd place; English: 3^rd place)

Burke, De Werra & Kingston (2004). Burke, E.; De Werra, D.; Kingston, J. (2004), "5.6.5 Sports Timetabling", in J. L., Gross; Yellen, J. (eds.), Handbook of Graph Theory, CRC Press, p. 462, ISBN 978-1-58488-090-5.

cmu.edu (Global: 1,564^th place; English: 1,028^th place)

math.cmu.edu

Fouquet & Jolivet (1983); Mahdian (2002); Frieze, Krivelevich & Sudakov (2005); Cranston (2006). Fouquet, J.-L.; Jolivet, J.-L. (1983), "Strong edge-colorings of graphs and applications to multi- $k$ -gons", Ars Combinatoria, 16 (A): 141–150, MR 0737086. Mahdian, Mohammad (2002), "On the computational complexity of strong edge coloring", Discrete Applied Mathematics, 118 (3): 239–248, doi:10.1016/S0166-218X(01)00237-2, MR 1892971. Frieze, Alan M.; Krivelevich, Michael; Sudakov, Benny (2005), "The strong chromatic index of random graphs" (PDF), SIAM Journal on Discrete Mathematics, 19 (3): 719–727 (electronic), doi:10.1137/S0895480104445757, MR 2191290. Cranston, Daniel W. (2006), "Strong edge-coloring of graphs with maximum degree 4 using 22 colors", Discrete Mathematics, 306 (21): 2772–2778, arXiv:math/0601623, Bibcode:2006math......1623C, doi:10.1016/j.disc.2006.03.053, MR 2264374, S2CID 1097275.

doi.org (Global: 2^nd place; English: 2^nd place)

Biggs (1972); Meredith & Lloyd (1973); Biggs (1979). Biggs, Norman (1972), Guy, Richard K. (ed.), "An edge-colouring problem", Research Problems, American Mathematical Monthly, 79 (9): 1018–1020, doi:10.2307/2318076, JSTOR 2318076. Meredith, Guy H. J.; Lloyd, E. Keith (1973), "The footballers of Croam", Journal of Combinatorial Theory, Series B, 15 (2): 161–166, doi:10.1016/0095-8956(73)90016-6. Biggs, Norman (1979), "Some odd graph theory", Second International Conference on Combinatorial Mathematics, Annals of the New York Academy of Sciences, 319 (1): 71–81, Bibcode:1979NYASA.319...71B, doi:10.1111/j.1749-6632.1979.tb32775.x, S2CID 84995087.
Kőnig (1916) Kőnig, D. (1916), "Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre", Mathematische Annalen, 77 (4): 453–465, doi:10.1007/BF01456961, hdl:10338.dmlcz/127635, S2CID 121097364, archived from the original on 2015-01-19, retrieved 2013-09-30.
Erdős & Wilson (1977). Erdős, Paul; Wilson, Robin J. (1977), "Note on the chromatic index of almost all graphs" (PDF), Journal of Combinatorial Theory, Series B, 23 (2–3): 255–257, doi:10.1016/0095-8956(77)90039-9.
Holyer (1981). Holyer, Ian (1981), "The NP-completeness of edge-coloring", SIAM Journal on Computing, 10 (4): 718–720, doi:10.1137/0210055, S2CID 13131049.
Sanders & Zhao (2001). Sanders, Daniel P.; Zhao, Yue (2001), "Planar graphs of maximum degree seven are class I", Journal of Combinatorial Theory, Series B, 83 (2): 201–212, doi:10.1006/jctb.2001.2047.
Tait (1880); Appel & Haken (1976). Tait, P. G. (1880), "Remarks on the colourings of maps", Proc. R. Soc. Edinburgh, 10: 729, doi:10.1017/S0370164600044643. Appel, K.; Haken, W. (1976), "Every planar map is four colorable", Bulletin of the American Mathematical Society, 82 (5): 711–712, doi:10.1090/S0002-9904-1976-14122-5, MR 0424602.
Bar-Noy, Motwani & Naor (1992). Bar-Noy, Amotz; Motwani, Rajeev; Naor, Joseph (1992), "The greedy algorithm is optimal for on-line edge coloring", Information Processing Letters, 44 (5): 251–253, doi:10.1016/0020-0190(92)90209-E.
Goldberg (1973); Andersen (1977); Seymour (1979). Goldberg, M. K. (1973), "Multigraphs with a chromatic index that is nearly maximal", Diskret. Analiz. (23): 3–7, 72, MR 0354429. As cited by Chen, Yu & Zang (2011). Andersen, Lars Døvling (1977), "On edge-colourings of graphs", Mathematica Scandinavica, 40 (2): 161–175, doi:10.7146/math.scand.a-11685, MR 0465922. As cited by Chen, Yu & Zang (2011). Seymour, P. D. (1979), "On multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte", Proceedings of the London Mathematical Society, Third Series, 38 (3): 423–460, doi:10.1112/plms/s3-38.3.423, MR 0532981.
Chen, Yu & Zang (2011). Chen, Guantao; Yu, Xingxing; Zang, Wenan (2011), "Approximating the chromatic index of multigraphs", Journal of Combinatorial Optimization, 21 (2): 219–246, doi:10.1007/s10878-009-9232-y, MR 2770056, S2CID 169162.
Eppstein (2013). Eppstein, David (2013), "The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing", Journal of Graph Algorithms and Applications, 17 (1): 35–55, arXiv:0709.4087, doi:10.7155/jgaa.00283, S2CID 2716392.
Schwenk (1989). Schwenk, Allen J. (1989), "Enumeration of Hamiltonian cycles in certain generalized Petersen graphs", Journal of Combinatorial Theory, Series B, 47 (1): 53–59, doi:10.1016/0095-8956(89)90064-6, MR 1007713.
Bosák (1972). Bosák, Juraj (1972), "Chromatic index of finite and infinite graphs", Czechoslovak Mathematical Journal, 22 (97): 272–290, doi:10.21136/CMJ.1972.101098, MR 0309777.
Akiyama, Exoo & Harary (1980); Habib & Péroche (1982); Horák & Niepel (1982). Habib, M.; Péroche, B. (1982), "Some problems about linear arboricity", Discrete Mathematics, 41 (2): 219–220, doi:10.1016/0012-365X(82)90209-6, MR 0676882. Horák, Peter; Niepel, Ľudovít (1982), "A short proof of a linear arboricity theorem for cubic graphs", Acta Mathematica Universitatis Comenianae, 40/41: 275–277, MR 0686983.
Nash-Williams (1964). Nash-Williams, C. St. J. A. (1964), "Decomposition of finite graphs into forests", Journal of the London Mathematical Society, Second Series, 39: 12, doi:10.1112/jlms/s1-39.1.12, MR 0161333
Gabow & Westermann (1992). Gabow, Harold N.; Westermann, Herbert H. (1992), "Forests, frames, and games: algorithms for matroid sums and applications", Algorithmica, 7 (5–6): 465–497, doi:10.1007/BF01758774, MR 1154585, S2CID 40358357.
Fouquet & Jolivet (1983); Mahdian (2002); Frieze, Krivelevich & Sudakov (2005); Cranston (2006). Fouquet, J.-L.; Jolivet, J.-L. (1983), "Strong edge-colorings of graphs and applications to multi- $k$ -gons", Ars Combinatoria, 16 (A): 141–150, MR 0737086. Mahdian, Mohammad (2002), "On the computational complexity of strong edge coloring", Discrete Applied Mathematics, 118 (3): 239–248, doi:10.1016/S0166-218X(01)00237-2, MR 1892971. Frieze, Alan M.; Krivelevich, Michael; Sudakov, Benny (2005), "The strong chromatic index of random graphs" (PDF), SIAM Journal on Discrete Mathematics, 19 (3): 719–727 (electronic), doi:10.1137/S0895480104445757, MR 2191290. Cranston, Daniel W. (2006), "Strong edge-coloring of graphs with maximum degree 4 using 22 colors", Discrete Mathematics, 306 (21): 2772–2778, arXiv:math/0601623, Bibcode:2006math......1623C, doi:10.1016/j.disc.2006.03.053, MR 2264374, S2CID 1097275.
Barrett et al. (2006). Barrett, C.L.; Istrate, G.; Kumar, V.S.A.; Marathe, M.V.; Thite, S.; Thulasidasan, S. (2006), "Strong edge coloring for channel assignment in wireless radio networks", Proc. Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops 2006), p. 106, doi:10.1109/PERCOMW.2006.129, ISBN 0-7695-2520-2, S2CID 5797236.
Alon, Sudakov & Zaks (2001); Muthu, Narayanan & Subramanian (2007). Alon, Noga; Sudakov, Benny; Zaks, Ayal (2001), "Acyclic edge colorings of graphs", Journal of Graph Theory, 37 (3): 157–167, doi:10.1002/jgt.1010, MR 1837021. Muthu, Rahul; Narayanan, N.; Subramanian, C. R. (2007), "Improved bounds on acyclic edge colouring", Discrete Mathematics, 307 (23): 3063–3069, doi:10.1016/j.disc.2007.03.006, MR 2371078.
Fiamčik (1978); Alon, Sudakov & Zaks (2001) Fiamčik, J. (1978), "The acyclic chromatic class of a graph", Math. Slovaca, 28: 139–145. Alon, Noga; Sudakov, Benny; Zaks, Ayal (2001), "Acyclic edge colorings of graphs", Journal of Graph Theory, 37 (3): 157–167, doi:10.1002/jgt.1010, MR 1837021.
Giotis et al. (2015). Giotis, I.; Kirousis, L.; Psaromiligkos, K. I.; Thilikos, D. M. (2015), "On the algorithmic Lovász Local Lemma and acyclic edge coloring", Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), p. 16, doi:10.1137/1.9781611973761.2, ISBN 978-1-61197-376-1.
Alon, Sudakov & Zaks (2001). Alon, Noga; Sudakov, Benny; Zaks, Ayal (2001), "Acyclic edge colorings of graphs", Journal of Graph Theory, 37 (3): 157–167, doi:10.1002/jgt.1010, MR 1837021.
Cai et al. (2014). Cai, X. S.; Perarnau, G.; Reed, B. A.; Watts, A. B. (2014), "Acyclic edge colourings of graphs with large girth", Random Structures & Algorithms, 50 (4): 511–533, arXiv:1411.3047, doi:10.1002/rsa.20695, S2CID 7727097.
Skiena (2008). Skiena, Steven S. (2008), "16.8 Edge Coloring", The Algorithm Design Manual (2nd ed.), Springer-Verlag, pp. 548–550, doi:10.1007/978-1-84800-070-4_16, ISBN 978-1-84800-069-8. See also web site for this section of the book in the Stony Brook Algorithm Repository.
Williamson et al. (1997). Williamson, D. P.; Hall, L. A.; Hoogeveen, J. A.; Hurkens, C. A. J.; Lenstra, J. K.; Sevast'janov, S. V.; Shmoys, D. B. (1997), "Short shop schedules", Operations Research, 45 (2): 288–294, doi:10.1287/opre.45.2.288, JSTOR 171745, MR 1644998.
Erlebach & Jansen (2001). Erlebach, Thomas; Jansen, Klaus (2001), "The complexity of path coloring and call scheduling", Theoretical Computer Science, 255 (1–2): 33–50, doi:10.1016/S0304-3975(99)00152-8, MR 1819065.
Chudnovsky, Edwards & Seymour (2015). Chudnovsky, Maria; Edwards, Katherine; Seymour, Paul (November 2015), "Edge-colouring eight-regular planar graphs", Journal of Combinatorial Theory, Series B, 115: 303–338, arXiv:1209.1176, doi:10.1016/j.jctb.2015.05.002.

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Kőnig (1916) Kőnig, D. (1916), "Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre", Mathematische Annalen, 77 (4): 453–465, doi:10.1007/BF01456961, hdl:10338.dmlcz/127635, S2CID 121097364, archived from the original on 2015-01-19, retrieved 2013-09-30.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Biggs (1972); Meredith & Lloyd (1973); Biggs (1979). Biggs, Norman (1972), Guy, Richard K. (ed.), "An edge-colouring problem", Research Problems, American Mathematical Monthly, 79 (9): 1018–1020, doi:10.2307/2318076, JSTOR 2318076. Meredith, Guy H. J.; Lloyd, E. Keith (1973), "The footballers of Croam", Journal of Combinatorial Theory, Series B, 15 (2): 161–166, doi:10.1016/0095-8956(73)90016-6. Biggs, Norman (1979), "Some odd graph theory", Second International Conference on Combinatorial Mathematics, Annals of the New York Academy of Sciences, 319 (1): 71–81, Bibcode:1979NYASA.319...71B, doi:10.1111/j.1749-6632.1979.tb32775.x, S2CID 84995087.
Fouquet & Jolivet (1983); Mahdian (2002); Frieze, Krivelevich & Sudakov (2005); Cranston (2006). Fouquet, J.-L.; Jolivet, J.-L. (1983), "Strong edge-colorings of graphs and applications to multi- $k$ -gons", Ars Combinatoria, 16 (A): 141–150, MR 0737086. Mahdian, Mohammad (2002), "On the computational complexity of strong edge coloring", Discrete Applied Mathematics, 118 (3): 239–248, doi:10.1016/S0166-218X(01)00237-2, MR 1892971. Frieze, Alan M.; Krivelevich, Michael; Sudakov, Benny (2005), "The strong chromatic index of random graphs" (PDF), SIAM Journal on Discrete Mathematics, 19 (3): 719–727 (electronic), doi:10.1137/S0895480104445757, MR 2191290. Cranston, Daniel W. (2006), "Strong edge-coloring of graphs with maximum degree 4 using 22 colors", Discrete Mathematics, 306 (21): 2772–2778, arXiv:math/0601623, Bibcode:2006math......1623C, doi:10.1016/j.disc.2006.03.053, MR 2264374, S2CID 1097275.
Eppstein (2010). Eppstein, David (2010), "Regular labelings and geometric structures", Proc. 22nd Canadian Conference on Computational Geometry (CCCG 2010) (PDF), University of Manitoba, arXiv:1007.0221, Bibcode:2010arXiv1007.0221E.

jstor.org (Global: 26^th place; English: 20^th place)

Biggs (1972); Meredith & Lloyd (1973); Biggs (1979). Biggs, Norman (1972), Guy, Richard K. (ed.), "An edge-colouring problem", Research Problems, American Mathematical Monthly, 79 (9): 1018–1020, doi:10.2307/2318076, JSTOR 2318076. Meredith, Guy H. J.; Lloyd, E. Keith (1973), "The footballers of Croam", Journal of Combinatorial Theory, Series B, 15 (2): 161–166, doi:10.1016/0095-8956(73)90016-6. Biggs, Norman (1979), "Some odd graph theory", Second International Conference on Combinatorial Mathematics, Annals of the New York Academy of Sciences, 319 (1): 71–81, Bibcode:1979NYASA.319...71B, doi:10.1111/j.1749-6632.1979.tb32775.x, S2CID 84995087.
Williamson et al. (1997). Williamson, D. P.; Hall, L. A.; Hoogeveen, J. A.; Hurkens, C. A. J.; Lenstra, J. K.; Sevast'janov, S. V.; Shmoys, D. B. (1997), "Short shop schedules", Operations Research, 45 (2): 288–294, doi:10.1287/opre.45.2.288, JSTOR 171745, MR 1644998.

renyi.hu (Global: low place; English: low place)

Erdős & Wilson (1977). Erdős, Paul; Wilson, Robin J. (1977), "Note on the chromatic index of almost all graphs" (PDF), Journal of Combinatorial Theory, Series B, 23 (2–3): 255–257, doi:10.1016/0095-8956(77)90039-9.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Biggs (1972); Meredith & Lloyd (1973); Biggs (1979). Biggs, Norman (1972), Guy, Richard K. (ed.), "An edge-colouring problem", Research Problems, American Mathematical Monthly, 79 (9): 1018–1020, doi:10.2307/2318076, JSTOR 2318076. Meredith, Guy H. J.; Lloyd, E. Keith (1973), "The footballers of Croam", Journal of Combinatorial Theory, Series B, 15 (2): 161–166, doi:10.1016/0095-8956(73)90016-6. Biggs, Norman (1979), "Some odd graph theory", Second International Conference on Combinatorial Mathematics, Annals of the New York Academy of Sciences, 319 (1): 71–81, Bibcode:1979NYASA.319...71B, doi:10.1111/j.1749-6632.1979.tb32775.x, S2CID 84995087.
Kőnig (1916) Kőnig, D. (1916), "Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre", Mathematische Annalen, 77 (4): 453–465, doi:10.1007/BF01456961, hdl:10338.dmlcz/127635, S2CID 121097364, archived from the original on 2015-01-19, retrieved 2013-09-30.
Holyer (1981). Holyer, Ian (1981), "The NP-completeness of edge-coloring", SIAM Journal on Computing, 10 (4): 718–720, doi:10.1137/0210055, S2CID 13131049.
Chen, Yu & Zang (2011). Chen, Guantao; Yu, Xingxing; Zang, Wenan (2011), "Approximating the chromatic index of multigraphs", Journal of Combinatorial Optimization, 21 (2): 219–246, doi:10.1007/s10878-009-9232-y, MR 2770056, S2CID 169162.
Eppstein (2013). Eppstein, David (2013), "The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing", Journal of Graph Algorithms and Applications, 17 (1): 35–55, arXiv:0709.4087, doi:10.7155/jgaa.00283, S2CID 2716392.
Gabow & Westermann (1992). Gabow, Harold N.; Westermann, Herbert H. (1992), "Forests, frames, and games: algorithms for matroid sums and applications", Algorithmica, 7 (5–6): 465–497, doi:10.1007/BF01758774, MR 1154585, S2CID 40358357.
Fouquet & Jolivet (1983); Mahdian (2002); Frieze, Krivelevich & Sudakov (2005); Cranston (2006). Fouquet, J.-L.; Jolivet, J.-L. (1983), "Strong edge-colorings of graphs and applications to multi- $k$ -gons", Ars Combinatoria, 16 (A): 141–150, MR 0737086. Mahdian, Mohammad (2002), "On the computational complexity of strong edge coloring", Discrete Applied Mathematics, 118 (3): 239–248, doi:10.1016/S0166-218X(01)00237-2, MR 1892971. Frieze, Alan M.; Krivelevich, Michael; Sudakov, Benny (2005), "The strong chromatic index of random graphs" (PDF), SIAM Journal on Discrete Mathematics, 19 (3): 719–727 (electronic), doi:10.1137/S0895480104445757, MR 2191290. Cranston, Daniel W. (2006), "Strong edge-coloring of graphs with maximum degree 4 using 22 colors", Discrete Mathematics, 306 (21): 2772–2778, arXiv:math/0601623, Bibcode:2006math......1623C, doi:10.1016/j.disc.2006.03.053, MR 2264374, S2CID 1097275.
Barrett et al. (2006). Barrett, C.L.; Istrate, G.; Kumar, V.S.A.; Marathe, M.V.; Thite, S.; Thulasidasan, S. (2006), "Strong edge coloring for channel assignment in wireless radio networks", Proc. Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops 2006), p. 106, doi:10.1109/PERCOMW.2006.129, ISBN 0-7695-2520-2, S2CID 5797236.
Cai et al. (2014). Cai, X. S.; Perarnau, G.; Reed, B. A.; Watts, A. B. (2014), "Acyclic edge colourings of graphs with large girth", Random Structures & Algorithms, 50 (4): 511–533, arXiv:1411.3047, doi:10.1002/rsa.20695, S2CID 7727097.

sunysb.edu (Global: 9,785^th place; English: 9,347^th place)

cs.sunysb.edu

Skiena (2008). Skiena, Steven S. (2008), "16.8 Edge Coloring", The Algorithm Design Manual (2nd ed.), Springer-Verlag, pp. 548–550, doi:10.1007/978-1-84800-070-4_16, ISBN 978-1-84800-069-8. See also web site for this section of the book in the Stony Brook Algorithm Repository.

umanitoba.ca (Global: 8,208^th place; English: 5,328^th place)

cs.umanitoba.ca

Eppstein (2010). Eppstein, David (2010), "Regular labelings and geometric structures", Proc. 22nd Canadian Conference on Computational Geometry (CCCG 2010) (PDF), University of Manitoba, arXiv:1007.0221, Bibcode:2010arXiv1007.0221E.

uni-goettingen.de (Global: 2,594^th place; English: 2,546^th place)

gdz.sub.uni-goettingen.de

Kőnig (1916) Kőnig, D. (1916), "Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre", Mathematische Annalen, 77 (4): 453–465, doi:10.1007/BF01456961, hdl:10338.dmlcz/127635, S2CID 121097364, archived from the original on 2015-01-19, retrieved 2013-09-30.

web.archive.org (Global: 1^st place; English: 1^st place)

Kőnig (1916) Kőnig, D. (1916), "Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre", Mathematische Annalen, 77 (4): 453–465, doi:10.1007/BF01456961, hdl:10338.dmlcz/127635, S2CID 121097364, archived from the original on 2015-01-19, retrieved 2013-09-30.

Edge coloring (English Wikipedia)

acm.org (Global: 1,185th place; English: 840th place)

portal.acm.org

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

books.google.com (Global: 3rd place; English: 3rd place)

cmu.edu (Global: 1,564th place; English: 1,028th place)