References analysis of the Wikipedia article "Greedy coloring" in the English version

ams.org

mathscinet.ams.org

Mitchem (1976). Mitchem, John (1976), "On various algorithms for estimating the chromatic number of a graph", The Computer Journal, 19 (2): 182–183, doi:10.1093/comjnl/19.2.182, MR 0437376.

Hoàng & Sritharan (2016), Theorem 28.33, p. 738; Husfeldt (2015), Algorithm G Hoàng, Chinh T.; Sritharan, R. (2016), "Chapter 28. Perfect Graphs", in Thulasiraman, Krishnaiyan; Arumugam, Subramanian; Brandstädt, Andreas; Nishizeki, Takao (eds.), Handbook of Graph Theory, Combinatorial Optimization, and Algorithms, Chapman & Hall/CRC Computer and Information Science Series, vol. 34, CRC Press, pp. 707–750, ISBN 9781420011074. Husfeldt, Thore (2015), "Graph colouring algorithms", in Beineke, Lowell W.; Wilson, Robin J. (eds.), Topics in Chromatic Graph Theory, Encyclopedia of Mathematics and its Applications, vol. 156, Cambridge University Press, pp. 277–303, arXiv:1505.05825, MR 3380176

Frieze & McDiarmid (1997). Frieze, Alan; McDiarmid, Colin (1997), "Algorithmic theory of random graphs", Random Structures & Algorithms, 10 (1–2): 5–42, doi:10.1002/(SICI)1098-2418(199701/03)10:1/2<5::AID-RSA2>3.3.CO;2-6, MR 1611517.

Johnson (1974); Husfeldt (2015). Johnson, David S. (1974), "Worst case behavior of graph coloring algorithms", Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1974), Congressus Numerantium, vol. X, Winnipeg, Manitoba: Utilitas Math., pp. 513–527, MR 0389644. Husfeldt, Thore (2015), "Graph colouring algorithms", in Beineke, Lowell W.; Wilson, Robin J. (eds.), Topics in Chromatic Graph Theory, Encyclopedia of Mathematics and its Applications, vol. 156, Cambridge University Press, pp. 277–303, arXiv:1505.05825, MR 3380176

Kučera (1991); Husfeldt (2015). Kučera, Luděk (1991), "The greedy coloring is a bad probabilistic algorithm", Journal of Algorithms, 12 (4): 674–684, doi:10.1016/0196-6774(91)90040-6, MR 1130323. Husfeldt, Thore (2015), "Graph colouring algorithms", in Beineke, Lowell W.; Wilson, Robin J. (eds.), Topics in Chromatic Graph Theory, Encyclopedia of Mathematics and its Applications, vol. 156, Cambridge University Press, pp. 277–303, arXiv:1505.05825, MR 3380176

Husfeldt (2015). Husfeldt, Thore (2015), "Graph colouring algorithms", in Beineke, Lowell W.; Wilson, Robin J. (eds.), Topics in Chromatic Graph Theory, Encyclopedia of Mathematics and its Applications, vol. 156, Cambridge University Press, pp. 277–303, arXiv:1505.05825, MR 3380176

Maffray (2003). Maffray, Frédéric (2003), "On the coloration of perfect graphs", in Reed, Bruce A.; Sales, Cláudia L. (eds.), Recent Advances in Algorithms and Combinatorics, CMS Books in Mathematics, vol. 11, Springer-Verlag, pp. 65–84, doi:10.1007/0-387-22444-0_3, ISBN 0-387-95434-1, MR 1952983.

Rose, Lueker & Tarjan (1976). Rose, D.; Lueker, George; Tarjan, Robert E. (1976), "Algorithmic aspects of vertex elimination on graphs", SIAM Journal on Computing, 5 (2): 266–283, doi:10.1137/0205021, MR 0408312.

Chvátal (1984); Husfeldt (2015). Chvátal, Václav (1984), "Perfectly orderable graphs", in Berge, Claude; Chvátal, Václav (eds.), Topics in Perfect Graphs, Annals of Discrete Mathematics, vol. 21, Amsterdam: North-Holland, pp. 63–68. As cited by Maffray (2003). Husfeldt, Thore (2015), "Graph colouring algorithms", in Beineke, Lowell W.; Wilson, Robin J. (eds.), Topics in Chromatic Graph Theory, Encyclopedia of Mathematics and its Applications, vol. 156, Cambridge University Press, pp. 277–303, arXiv:1505.05825, MR 3380176

Middendorf & Pfeiffer (1990). Middendorf, Matthias; Pfeiffer, Frank (1990), "On the complexity of recognizing perfectly orderable graphs", Discrete Mathematics, 80 (3): 327–333, doi:10.1016/0012-365X(90)90251-C, MR 1049253.

Zaker (2006). Zaker, Manouchehr (2006), "Results on the Grundy chromatic number of graphs", Discrete Mathematics, 306 (2–3): 3166–3173, doi:10.1016/j.disc.2005.06.044, MR 2273147.

Christen & Selkow (1979). Christen, Claude A.; Selkow, Stanley M. (1979), "Some perfect coloring properties of graphs", Journal of Combinatorial Theory, Series B, 27 (1): 49–59, doi:10.1016/0095-8956(79)90067-4, MR 0539075

Mitchem (1976); Husfeldt (2015). Mitchem, John (1976), "On various algorithms for estimating the chromatic number of a graph", The Computer Journal, 19 (2): 182–183, doi:10.1093/comjnl/19.2.182, MR 0437376. Husfeldt, Thore (2015), "Graph colouring algorithms", in Beineke, Lowell W.; Wilson, Robin J. (eds.), Topics in Chromatic Graph Theory, Encyclopedia of Mathematics and its Applications, vol. 156, Cambridge University Press, pp. 277–303, arXiv:1505.05825, MR 3380176

Matula & Beck (1983). Matula, David W.; Beck, L. L. (1983), "Smallest-last ordering and clustering and graph coloring algorithms", Journal of the ACM, 30 (3): 417–427, doi:10.1145/2402.322385, MR 0709826.

Welsh & Powell (1967); Husfeldt (2015). Welsh, D. J. A.; Powell, M. B. (1967), "An upper bound for the chromatic number of a graph and its application to timetabling problems", The Computer Journal, 10 (1): 85–86, doi:10.1093/comjnl/10.1.85. Husfeldt, Thore (2015), "Graph colouring algorithms", in Beineke, Lowell W.; Wilson, Robin J. (eds.), Topics in Chromatic Graph Theory, Encyclopedia of Mathematics and its Applications, vol. 156, Cambridge University Press, pp. 277–303, arXiv:1505.05825, MR 3380176

Kosowski & Manuszewski (2004). Kosowski, Adrian; Manuszewski, Krzysztof (2004), "Classical coloring of graphs", in Kubale, Marek (ed.), Graph Colorings, Contemporary Mathematics, vol. 352, Providence, Rhode Island: American Mathematical Society, pp. 1–19, doi:10.1090/conm/352/06369, ISBN 978-0-8218-3458-9, MR 2076987

Markossian, Gasparian & Reed (1996); Maffray (2003). Markossian, S. E.; Gasparian, G. S.; Reed, B. A. (1996), "β-perfect graphs", Journal of Combinatorial Theory, Series B, 67 (1): 1–11, doi:10.1006/jctb.1996.0030, MR 1385380. Maffray, Frédéric (2003), "On the coloration of perfect graphs", in Reed, Bruce A.; Sales, Cláudia L. (eds.), Recent Advances in Algorithms and Combinatorics, CMS Books in Mathematics, vol. 11, Springer-Verlag, pp. 65–84, doi:10.1007/0-387-22444-0_3, ISBN 0-387-95434-1, MR 1952983.

Markossian, Gasparian & Reed (1996). Markossian, S. E.; Gasparian, G. S.; Reed, B. A. (1996), "β-perfect graphs", Journal of Combinatorial Theory, Series B, 67 (1): 1–11, doi:10.1006/jctb.1996.0030, MR 1385380.

Gräf, Stumpf & Weißenfels (1998). Gräf, A.; Stumpf, M.; Weißenfels, G. (1998), "On coloring unit disk graphs", Algorithmica, 20 (3): 277–293, doi:10.1007/PL00009196, MR 1489033, S2CID 36161020.

Janczewski et al. (2001). Janczewski, R.; Kubale, M.; Manuszewski, K.; Piwakowski, K. (2001), "The smallest hard-to-color graph for algorithm DSATUR", Discrete Mathematics, 236 (1–3): 151–165, doi:10.1016/S0012-365X(00)00439-8, MR 1830607.

Irani (1994). Irani, Sandy (1994), "Coloring inductive graphs on-line", Algorithmica, 11 (1): 53–72, doi:10.1007/BF01294263, MR 1247988, S2CID 181800.

Lovász, Saks & Trotter (1989); Vishwanathan (1992). Lovász, L.; Saks, M. E.; Trotter, W. T. (1989), "An on-line graph coloring algorithm with sublinear performance ratio", Discrete Mathematics, 75 (1–3): 319–325, doi:10.1016/0012-365X(89)90096-4, MR 1001404. Vishwanathan, Sundar (1992), "Randomized online graph coloring", Journal of Algorithms, 13 (4): 657–669, doi:10.1016/0196-6774(92)90061-G, MR 1187207.

Kierstead & Trotter (1981). Kierstead, H. A.; Trotter, W. T. (1981), "An extremal problem in recursive combinatorics", Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. II (Baton Rouge, La., 1981), Congressus Numerantium, 33: 143–153, MR 0681909. As cited by Irani (1994).

Simmons (1982); Erdős et al. (1987). Simmons, Gustavus J. (1982), "The ordered chromatic number of planar maps", Proceedings of the thirteenth Southeastern conference on combinatorics, graph theory and computing (Boca Raton, Fla., 1982), Congressus Numerantium, 36: 59–67, MR 0726050 Erdős, P.; Hare, W. R.; Hedetniemi, S. T.; Laskar, R. (1987), "On the equality of the Grundy and ochromatic numbers of a graph" (PDF), Journal of Graph Theory, 11 (2): 157–159, doi:10.1002/jgt.3190110205, MR 0889347.

E.g., see Section 1.1 of Nivasch (2006). Nivasch, Gabriel (2006), "The Sprague–Grundy function of the game Euclid", Discrete Mathematics, 306 (21): 2798–2800, doi:10.1016/j.disc.2006.04.020, MR 2264378.

Lovász (1975). Lovász, L. (1975), "Three short proofs in graph theory", Journal of Combinatorial Theory, Series B, 19 (3): 269–271, doi:10.1016/0095-8956(75)90089-1, MR 0396344.

archives-ouvertes.fr

hal.archives-ouvertes.fr

Brélaz (1979); Lévêque & Maffray (2005). Lévêque, Benjamin; Maffray, Frédéric (October 2005), "Coloring Meyniel graphs in linear time" (PDF), in Raspaud, André; Delmas, Olivier (eds.), 7th International Colloquium on Graph Theory (ICGT '05), 12–16 September 2005, Hyeres, France, Electronic Notes in Discrete Mathematics, vol. 22, Elsevier, pp. 25–28, arXiv:cs/0405059, doi:10.1016/j.endm.2005.06.005, S2CID 6262680. See also Lévêque, Benjamin; Maffray, Frédéric (January 9, 2006), Erratum : MCColor is not optimal on Meyniel graphs, arXiv:cs/0405059.

Lévêque & Maffray (2005). Lévêque, Benjamin; Maffray, Frédéric (October 2005), "Coloring Meyniel graphs in linear time" (PDF), in Raspaud, André; Delmas, Olivier (eds.), 7th International Colloquium on Graph Theory (ICGT '05), 12–16 September 2005, Hyeres, France, Electronic Notes in Discrete Mathematics, vol. 22, Elsevier, pp. 25–28, arXiv:cs/0405059, doi:10.1016/j.endm.2005.06.005, S2CID 6262680. See also Lévêque, Benjamin; Maffray, Frédéric (January 9, 2006), Erratum : MCColor is not optimal on Meyniel graphs, arXiv:cs/0405059.

arxiv.org

books.google.com

doi.org

Mitchem (1976). Mitchem, John (1976), "On various algorithms for estimating the chromatic number of a graph", The Computer Journal, 19 (2): 182–183, doi:10.1093/comjnl/19.2.182, MR 0437376.

Welsh & Powell (1967). Welsh, D. J. A.; Powell, M. B. (1967), "An upper bound for the chromatic number of a graph and its application to timetabling problems", The Computer Journal, 10 (1): 85–86, doi:10.1093/comjnl/10.1.85.

Zaker (2006). Zaker, Manouchehr (2006), "Results on the Grundy chromatic number of graphs", Discrete Mathematics, 306 (2–3): 3166–3173, doi:10.1016/j.disc.2005.06.044, MR 2273147.

Matula (1968); Szekeres & Wilf (1968). Matula, David W. (1968), "A min-max theorem for graphs with application to graph coloring", SIAM 1968 National Meeting, SIAM Review, 10 (4): 481–482, doi:10.1137/1010115. Szekeres, George; Wilf, Herbert S. (1968), "An inequality for the chromatic number of a graph", Journal of Combinatorial Theory, 4: 1–3, doi:10.1016/S0021-9800(68)80081-X.

Irani (1994). Irani, Sandy (1994), "Coloring inductive graphs on-line", Algorithmica, 11 (1): 53–72, doi:10.1007/BF01294263, MR 1247988, S2CID 181800.

Poletto & Sarkar (1999). Although Poletto and Sarkar describe their register allocation method as not being based on graph coloring, it appears to be the same as greedy coloring. Poletto, Massimiliano; Sarkar, Vivek (September 1999), "Linear scan register allocation", ACM Transactions on Programming Languages and Systems, 21 (5): 895–913, doi:10.1145/330249.330250, S2CID 18180752.

Pereira & Palsberg (2005). Pereira, Fernando Magno Quintão; Palsberg, Jens (2005), "Register allocation via coloring of chordal graphs", in Yi, Kwangkeun (ed.), Programming Languages and Systems: Third Asian Symposium, APLAS 2005, Tsukuba, Japan, November 2–5, 2005, Proceedings, Lecture Notes in Computer Science, vol. 3780, Springer, pp. 315–329, doi:10.1007/11575467_21, ISBN 978-3-540-29735-2

Lovász (1975). Lovász, L. (1975), "Three short proofs in graph theory", Journal of Combinatorial Theory, Series B, 19 (3): 269–271, doi:10.1016/0095-8956(75)90089-1, MR 0396344.

renyi.hu

users.renyi.hu

semanticscholar.org

api.semanticscholar.org

Irani (1994). Irani, Sandy (1994), "Coloring inductive graphs on-line", Algorithmica, 11 (1): 53–72, doi:10.1007/BF01294263, MR 1247988, S2CID 181800.

Greedy coloring (English Wikipedia)

ams.org

mathscinet.ams.org

archives-ouvertes.fr

hal.archives-ouvertes.fr

arxiv.org

books.google.com

doi.org

renyi.hu

users.renyi.hu

semanticscholar.org

api.semanticscholar.org