Бојење грана графа (Serbian Wikipedia)
Analysis of information sources in references of the Wikipedia article "Бојење грана графа" in Serbian language version.
refsWebsite
Global rank
Serbian rank
low place
low place
1st place
1st place
2,594th place
2,408th place
8,208th place
9,413th place
3rd place
2nd place
9,785th place
6,452nd place
acm.org
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), стр. 31—39.
ams.org
- Tait 1880; Appel & Haken 1976 Tait, P. G. (1880), „Remarks on the colourings of maps”, Proc. R. Soc. Edinburgh, 10: 729. Appel, K.; Haken, W. (1976), „Every planar map is four colorable”, Bulletin of the American Mathematical Society, 82 (5): 711—712, MR 0424602, doi:10.1090/S0002-9904-1976-14122-5.
- 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, 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, MR 532981, doi:10.1112/plms/s3-38.3.423.
- 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, MR 2770056, doi:10.1007/s10878-009-9232-y.
- 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, MR 1007713, doi:10.1016/0095-8956(89)90064-6.
- Bosák 1972 Bosák, Juraj (1972), „Chromatic index of finite and infinite graphs”, Czechoslovak Mathematical Journal, 22(97): 272—290, MR 0309777.
- Akiyama, Exoo & Harary 1980; Habib & Péroche 1982; Horák & Niepel 1982 Akiyama, Jin; Exoo, Geoffrey; Harary, Frank (1980), „Covering and packing in graphs. III. Cyclic and acyclic invariants”, Mathematica Slovaca, 30 (4): 405—417, MR 595302. Habib, M.; Péroche, B. (1982), „Some problems about linear arboricity”, Discrete Mathematics, 41 (2): 219—220, MR 676882, doi:10.1016/0012-365X(82)90209-6. 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 686983.
- 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, 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, MR 1154585, doi:10.1007/BF01758774.
- 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 737086. Mahdian, Mohammad (2002), „On the computational complexity of strong edge coloring”, Discrete Applied Mathematics, 118 (3): 239—248, MR 1892971, doi:10.1016/S0166-218X(01)00237-2. Frieze, Alan M.; Krivelevich, Michael; Sudakov, Benny (2005), „The strong chromatic index of random graphs”, SIAM Journal on Discrete Mathematics, 19 (3): 719—727(electronic), MR 2191290, doi:10.1137/S0895480104445757. Cranston, Daniel W. (2006), „Strong edge-coloring of graphs with maximum degree 4 using 22 colors”, Discrete Mathematics, 306 (21): 2772—2778, MR 2264374, doi:10.1016/j.disc.2006.03.053.
- 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, MR 1837021, doi:10.1002/jgt.1010. Muthu, Rahul; Narayanan, N.; Subramanian, C. R. (2007), „Improved bounds on acyclic edge colouring”, Discrete Mathematics, 307 (23): 3063—3069, MR 2371078, doi:10.1016/j.disc.2007.03.006.
- 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, MR 1837021, doi:10.1002/jgt.1010.
- Alon, Sudakov & Zaks (2001). Alon, Noga; Sudakov, Benny; Zaks, Ayal (2001), „Acyclic edge colorings of graphs”, Journal of Graph Theory, 37 (3): 157—167, MR 1837021, doi:10.1002/jgt.1010.
- 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, JSTOR 171745, MR 1644998, doi:10.1287/opre.45.2.288.
- Erlebach & Jansen 2001 Erlebach, Thomas; Jansen, Klaus (2001), „The complexity of path coloring and call scheduling”, Theoretical Computer Science, 255 (1–2): 33—50, MR 1819065, doi:10.1016/S0304-3975(99)00152-8.
arxiv.org
- Eppstein 2008 Eppstein, David (2008), „The topology of bendless three-dimensional orthogonal graph drawing”, Ур.: Tollis, Ioannis G.; Patrignani, Marizio, Proc. 16th Int. Symp. Graph Drawing, Lecture Notes in Computer Science, 5417, Heraklion, Crete: Springer-Verlag, стр. 78—89, arXiv:0709.4087
. - Cai et al. (2014). Cai, X. S.; Perarnau, G.; Reed, B. A.; Watts, A. B. (2014), Acyclic edge colourings of graphs with large girth, arXiv:1411.3047 .
- 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 , Архивирано из оригинала (PDF) 20. 03. 2012. г., Приступљено 25. 05. 2015.
- Chudnovsky, Edwards & Seymour (2012). Chudnovsky, Maria; Edwards, Katherine; Seymour, Paul (2012), Edge-colouring eight-regular planar graphs, arXiv:1209.1176 .
books.google.com
- Burke, De Werra & Kingston 2004 Burke, E.; De Werra, D.; Kingston, J. (2004), „5.6.5 Sports Timetabling”, Ур.: J. L., Gross; Yellen, J., Handbook of Graph Theory, CRC Press, стр. 462, ISBN 978-1-58488-090-5.
doi.org
- Biggs 1972; Meredith & Lloyd 1973; Biggs 1979 Biggs, Norman (1972), Guy, Richard K., ур., „An edge-colouring problem”, Research Problems, American Mathematical Monthly (9 изд.), 79 (9): 1018—1020, 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, стр. 71—81, doi:10.1111/j.1749-6632.1979.tb32775.x.
- 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, Архивирано из оригинала 19. 1. 2015. г., Приступљено 25. 5. 2015.
- 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.
- 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. Appel, K.; Haken, W. (1976), „Every planar map is four colorable”, Bulletin of the American Mathematical Society, 82 (5): 711—712, MR 0424602, doi:10.1090/S0002-9904-1976-14122-5.
- 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, 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, MR 532981, doi:10.1112/plms/s3-38.3.423.
- 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, MR 2770056, doi:10.1007/s10878-009-9232-y.
- 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, MR 1007713, doi:10.1016/0095-8956(89)90064-6.
- Akiyama, Exoo & Harary 1980; Habib & Péroche 1982; Horák & Niepel 1982 Akiyama, Jin; Exoo, Geoffrey; Harary, Frank (1980), „Covering and packing in graphs. III. Cyclic and acyclic invariants”, Mathematica Slovaca, 30 (4): 405—417, MR 595302. Habib, M.; Péroche, B. (1982), „Some problems about linear arboricity”, Discrete Mathematics, 41 (2): 219—220, MR 676882, doi:10.1016/0012-365X(82)90209-6. 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 686983.
- 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, MR 1154585, doi:10.1007/BF01758774.
- 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 737086. Mahdian, Mohammad (2002), „On the computational complexity of strong edge coloring”, Discrete Applied Mathematics, 118 (3): 239—248, MR 1892971, doi:10.1016/S0166-218X(01)00237-2. Frieze, Alan M.; Krivelevich, Michael; Sudakov, Benny (2005), „The strong chromatic index of random graphs”, SIAM Journal on Discrete Mathematics, 19 (3): 719—727(electronic), MR 2191290, doi:10.1137/S0895480104445757. Cranston, Daniel W. (2006), „Strong edge-coloring of graphs with maximum degree 4 using 22 colors”, Discrete Mathematics, 306 (21): 2772—2778, MR 2264374, doi:10.1016/j.disc.2006.03.053.
- 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), стр. 106, ISBN 978-0-7695-2520-4, doi:10.1109/PERCOMW.2006.129.
- 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, MR 1837021, doi:10.1002/jgt.1010. Muthu, Rahul; Narayanan, N.; Subramanian, C. R. (2007), „Improved bounds on acyclic edge colouring”, Discrete Mathematics, 307 (23): 3063—3069, MR 2371078, doi:10.1016/j.disc.2007.03.006.
- 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, MR 1837021, doi:10.1002/jgt.1010.
- 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), стр. 16, ISBN 978-1-61197-376-1, doi:10.1137/1.9781611973761.2.
- Alon, Sudakov & Zaks (2001). Alon, Noga; Sudakov, Benny; Zaks, Ayal (2001), „Acyclic edge colorings of graphs”, Journal of Graph Theory, 37 (3): 157—167, MR 1837021, doi:10.1002/jgt.1010.
- Skiena 2008 Skiena, Steven S. (2008), „16.8 Edge Coloring”, The Algorithm Design Manual (2nd изд.), Springer-Verlag, стр. 548—550, ISBN 978-1-84800-069-8, doi:10.1007/978-1-84800-070-4_16. 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, JSTOR 171745, MR 1644998, doi:10.1287/opre.45.2.288.
- Erlebach & Jansen 2001 Erlebach, Thomas; Jansen, Klaus (2001), „The complexity of path coloring and call scheduling”, Theoretical Computer Science, 255 (1–2): 33—50, MR 1819065, doi:10.1016/S0304-3975(99)00152-8.
jstor.org
- Biggs 1972; Meredith & Lloyd 1973; Biggs 1979 Biggs, Norman (1972), Guy, Richard K., ур., „An edge-colouring problem”, Research Problems, American Mathematical Monthly (9 изд.), 79 (9): 1018—1020, 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, стр. 71—81, doi:10.1111/j.1749-6632.1979.tb32775.x.
- 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, JSTOR 171745, MR 1644998, doi:10.1287/opre.45.2.288.
renyi.hu
- 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.
sunysb.edu
cs.sunysb.edu
- Skiena 2008 Skiena, Steven S. (2008), „16.8 Edge Coloring”, The Algorithm Design Manual (2nd изд.), Springer-Verlag, стр. 548—550, ISBN 978-1-84800-069-8, doi:10.1007/978-1-84800-070-4_16. See also web site for this section of the book in the Stony Brook Algorithm Repository.
umanitoba.ca
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 , Архивирано из оригинала (PDF) 20. 03. 2012. г., Приступљено 25. 05. 2015.
uni-goettingen.de
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, Архивирано из оригинала 19. 1. 2015. г., Приступљено 25. 5. 2015.
web.archive.org
- 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, Архивирано из оригинала 19. 1. 2015. г., Приступљено 25. 5. 2015.
- 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 , Архивирано из оригинала (PDF) 20. 03. 2012. г., Приступљено 25. 05. 2015.
wikipedia.org
en.wikipedia.org
- Tait 1880; Appel & Haken 1976 Tait, P. G. (1880), „Remarks on the colourings of maps”, Proc. R. Soc. Edinburgh, 10: 729. Appel, K.; Haken, W. (1976), „Every planar map is four colorable”, Bulletin of the American Mathematical Society, 82 (5): 711—712, MR 0424602, doi:10.1090/S0002-9904-1976-14122-5.
- 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, 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, MR 532981, doi:10.1112/plms/s3-38.3.423.
- 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, MR 2770056, doi:10.1007/s10878-009-9232-y.
- 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, MR 1007713, doi:10.1016/0095-8956(89)90064-6.
- Bosák 1972 Bosák, Juraj (1972), „Chromatic index of finite and infinite graphs”, Czechoslovak Mathematical Journal, 22(97): 272—290, MR 0309777.
- Akiyama, Exoo & Harary 1980; Habib & Péroche 1982; Horák & Niepel 1982 Akiyama, Jin; Exoo, Geoffrey; Harary, Frank (1980), „Covering and packing in graphs. III. Cyclic and acyclic invariants”, Mathematica Slovaca, 30 (4): 405—417, MR 595302. Habib, M.; Péroche, B. (1982), „Some problems about linear arboricity”, Discrete Mathematics, 41 (2): 219—220, MR 676882, doi:10.1016/0012-365X(82)90209-6. 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 686983.
- 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, 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, MR 1154585, doi:10.1007/BF01758774.
- 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 737086. Mahdian, Mohammad (2002), „On the computational complexity of strong edge coloring”, Discrete Applied Mathematics, 118 (3): 239—248, MR 1892971, doi:10.1016/S0166-218X(01)00237-2. Frieze, Alan M.; Krivelevich, Michael; Sudakov, Benny (2005), „The strong chromatic index of random graphs”, SIAM Journal on Discrete Mathematics, 19 (3): 719—727(electronic), MR 2191290, doi:10.1137/S0895480104445757. Cranston, Daniel W. (2006), „Strong edge-coloring of graphs with maximum degree 4 using 22 colors”, Discrete Mathematics, 306 (21): 2772—2778, MR 2264374, doi:10.1016/j.disc.2006.03.053.
- 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, MR 1837021, doi:10.1002/jgt.1010. Muthu, Rahul; Narayanan, N.; Subramanian, C. R. (2007), „Improved bounds on acyclic edge colouring”, Discrete Mathematics, 307 (23): 3063—3069, MR 2371078, doi:10.1016/j.disc.2007.03.006.
- 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, MR 1837021, doi:10.1002/jgt.1010.
- Alon, Sudakov & Zaks (2001). Alon, Noga; Sudakov, Benny; Zaks, Ayal (2001), „Acyclic edge colorings of graphs”, Journal of Graph Theory, 37 (3): 157—167, MR 1837021, doi:10.1002/jgt.1010.
- 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, JSTOR 171745, MR 1644998, doi:10.1287/opre.45.2.288.
- Erlebach & Jansen 2001 Erlebach, Thomas; Jansen, Klaus (2001), „The complexity of path coloring and call scheduling”, Theoretical Computer Science, 255 (1–2): 33—50, MR 1819065, doi:10.1016/S0304-3975(99)00152-8.