Graph coloring (English Wikipedia)

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

Last modified: 13:44:30, 17 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

4236doi.org

2^nd place

2018semanticscholar.org

15^th place

8^th place

86springer.com

182^nd place

172^nd place

75arxiv.org

49^th place

31^st place

33adsabs.harvard.edu

14^th place

9^th place

22wolfram.com

1,091^st place

1,169^th place

22acm.org

1,200^th place

821^st place

11archive.org

6^th place

11hal.science

2,005^th place

1,689^th place

11rothamsted.ac.uk

low place

11helsinki.fi

1,384^th place

2,463^rd place

11purdue.edu

1,391^st place

979^th place

11hamilton.ie

low place

11worldcat.org

4^th place

11psu.edu

299^th place

159^th place

acm.org (Global: 1,200^th place; English: 821^st place)

portal.acm.org

Garey, Johnson & Stockmeyer (1974); Garey & Johnson (1979). Garey, M. R.; Johnson, D. S.; Stockmeyer, L. (1974), "Some simplified NP-complete problems", Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 47–63, doi:10.1145/800119.803884, ISBN 9781450374231, S2CID 207693360 Garey, M. R.; Johnson, D. S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, ISBN 0-7167-1045-5

dl.acm.org

Wrochna & Živný (2020). Wrochna, M.; Živný, S. (2020), "Improved hardness for $H$ -colourings of $G$ -colourable graphs", Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1426–1435

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Brooks (1941). Brooks, R. L. (1941), "On colouring the nodes of a network", Proceedings of the Cambridge Philosophical Society, 37 (2): 194–197, Bibcode:1941PCPS...37..194B, doi:10.1017/S030500410002168X, S2CID 209835194
Cole & Vishkin (1986), see also Cormen, Leiserson & Rivest (1990, Section 30.5). Cole, R.; Vishkin, U. (1986), "Deterministic coin tossing with applications to optimal parallel list ranking", Information and Control, 70 (1): 32–53, doi:10.1016/S0019-9958(86)80023-7 Cormen, T. H.; Leiserson, C. E.; Rivest, R. L. (1990), Introduction to Algorithms (1st ed.), The MIT Press, Bibcode:1990ita..book.....C
Jaeger, Vertigan & Welsh (1990). Jaeger, F.; Vertigan, D. L.; Welsh, D. J. A. (1990), "On the computational complexity of the Jones and Tutte polynomials", Mathematical Proceedings of the Cambridge Philosophical Society, 108 (1): 35–53, Bibcode:1990MPCPS.108...35J, doi:10.1017/S0305004100068936, S2CID 121454726

archive.org (Global: 6^th place; English: 6^th place)

Zhang (1997) Zhang, Cun-Quan (1997), Integer Flows and Cycle Covers of Graphs, CRC Press, ISBN 978-0-8247-9790-4

arxiv.org (Global: 49^th place; English: 31^st place)

Pawlik et al. (2014). Pawlik, A.; Kozik, J.; Krawczyk, T.; Lasoń, M.; Micek, P.; Trotter, W.; Walczak, B. (2014), "Triangle-free intersection graphs of line segments with large chromatic number", Journal of Combinatorial Theory, Series B, 105 (5): 6–10, arXiv:1209.1595, doi:10.1016/j.jctb.2013.11.001
Beigel & Eppstein (2005). Beigel, R.; Eppstein, D. (2005), "3-coloring in time $O (1.3289 n)$ ", Journal of Algorithms, 54 (2)): 168–204, arXiv:cs/0006046, doi:10.1016/j.jalgor.2004.06.008, S2CID 1209067
Barenboim & Elkin (2009); Kuhn (2009). Barenboim, L.; Elkin, M. (2009), "Distributed $(Δ + 1)$ -coloring in linear (in $Δ$ ) time", Proceedings of the 41st Symposium on Theory of Computing, pp. 111–120, arXiv:0812.1379, doi:10.1145/1536414.1536432, ISBN 978-1-60558-506-2, S2CID 13446345 Kuhn, F. (2009), "Weak graph colorings: distributed algorithms and applications", Proceedings of the 21st Symposium on Parallelism in Algorithms and Architectures, pp. 138–144, doi:10.1145/1583991.1584032, ISBN 978-1-60558-606-9, S2CID 8857534
Bulín, Krokhin & Opršal (2019). Bulín, J.; Krokhin, A.; Opršal, J. (2019), "Algebraic approach to promise constraint satisfaction", Proceedings of the 51st Annual ACM SIGACT Symposium on the Theory of Computing, pp. 602–613, arXiv:1811.00970, doi:10.1145/3313276.3316300, ISBN 978-1-4503-6705-9
Goldberg & Jerrum (2008). Goldberg, L. A.; Jerrum, M. (July 2008), "Inapproximability of the Tutte polynomial", Information and Computation, 206 (7): 908–929, arXiv:cs/0605140, doi:10.1016/j.ic.2008.04.003, S2CID 53304001

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

doi.org

Brooks (1941). Brooks, R. L. (1941), "On colouring the nodes of a network", Proceedings of the Cambridge Philosophical Society, 37 (2): 194–197, Bibcode:1941PCPS...37..194B, doi:10.1017/S030500410002168X, S2CID 209835194
Scott & Seymour (2020). Scott, Alex; Seymour, Paul (2020), "A survey of $χ$ -boundedness", Journal of Graph Theory, 95 (3): 2–3, doi:10.1002/jgt.22601, S2CID 4760027
Pawlik et al. (2014). Pawlik, A.; Kozik, J.; Krawczyk, T.; Lasoń, M.; Micek, P.; Trotter, W.; Walczak, B. (2014), "Triangle-free intersection graphs of line segments with large chromatic number", Journal of Combinatorial Theory, Series B, 105 (5): 6–10, arXiv:1209.1595, doi:10.1016/j.jctb.2013.11.001
Erdős (1959). Erdős, Paul (1959), "Graph theory and probability", Canadian Journal of Mathematics, 11: 34–38, doi:10.4153/CJM-1959-003-9, S2CID 122784453
Björklund, Husfeldt & Koivisto (2009), p. 550. Björklund, A.; Husfeldt, T.; Koivisto, M. (2009), "Set partitioning via inclusion–exclusion", SIAM Journal on Computing, 39 (2): 546–563, doi:10.1137/070683933
Lawler (1976). Lawler, E.L. (1976), "A note on the complexity of the chromatic number problem", Information Processing Letters, 5 (3): 66–67, doi:10.1016/0020-0190(76)90065-X
Beigel & Eppstein (2005). Beigel, R.; Eppstein, D. (2005), "3-coloring in time $O (1.3289 n)$ ", Journal of Algorithms, 54 (2)): 168–204, arXiv:cs/0006046, doi:10.1016/j.jalgor.2004.06.008, S2CID 1209067
Fomin, Gaspers & Saurabh (2007). Fomin, F.V.; Gaspers, S.; Saurabh, S. (2007), "Improved exact algorithms for counting 3- and 4-colorings", Proc. 13th Annual International Conference, COCOON 2007, Lecture Notes in Computer Science, vol. 4598, Springer, pp. 65–74, doi:10.1007/978-3-540-73545-8_9, ISBN 978-3-540-73544-1
Zamir (2021). Zamir, Or (2021), "Breaking the $2 n$ Barrier for 5-Coloring and 6-Coloring", in Bansal, Nikhil; Merelli, Emanuela; Worrell, James (eds.), 48th International Colloquium on Automata, Languages, and Programming (ICALP), Leibniz International Proceedings in Informatics (LIPIcs), vol. 198, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 113:1–113:20, doi:10.4230/LIPIcs.ICALP.2021.113, ISBN 978-3-95977-195-5
Sekine, Imai & Tani (1995). Sekine, Kyoko; Imai, Hiroshi; Tani, Seiichiro (1995), "Computing the Tutte polynomial of a graph of moderate size", Proc. 6th International Symposium on Algorithms and Computation (ISAAC 1995), Lecture Notes in Computer Science, vol. 1004, Springer, pp. 224–233, doi:10.1007/BFb0015427, ISBN 3-540-60573-8
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
Brélaz (1979). Brélaz, D. (1979), "New methods to color the vertices of a graph", Communications of the ACM, 22 (4): 251–256, doi:10.1145/359094.359101, S2CID 14838769
Lewis (2021). Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Schneider & Wattenhofer (2010). Schneider, Johannes; Wattenhofer, Roger (2010), "A new technique for distributed symmetry breaking", in Richa, Andréa W.; Guerraoui, Rachid (eds.), Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25–28, 2010, Association for Computing Machinery, pp. 257–266, doi:10.1145/1835698.1835760, ISBN 978-1-60558-888-9
Cole & Vishkin (1986), see also Cormen, Leiserson & Rivest (1990, Section 30.5). Cole, R.; Vishkin, U. (1986), "Deterministic coin tossing with applications to optimal parallel list ranking", Information and Control, 70 (1): 32–53, doi:10.1016/S0019-9958(86)80023-7 Cormen, T. H.; Leiserson, C. E.; Rivest, R. L. (1990), Introduction to Algorithms (1st ed.), The MIT Press, Bibcode:1990ita..book.....C
Goldberg, Plotkin & Shannon (1988). Goldberg, A. V.; Plotkin, S. A.; Shannon, G. E. (1988), "Parallel symmetry-breaking in sparse graphs", SIAM Journal on Discrete Mathematics, 1 (4): 434–446, doi:10.1137/0401044
Schneider & Wattenhofer (2008). Schneider, Johannes; Wattenhofer, Roger (2008), "A log-star distributed maximal independent set algorithm for growth-bounded graphs", in Bazzi, Rida A.; Patt-Shamir, Boaz (eds.), Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18–21, 2008, Association for Computing Machinery, pp. 35–44, doi:10.1145/1400751.1400758, ISBN 978-1-59593-989-0
Barenboim & Elkin (2009); Kuhn (2009). Barenboim, L.; Elkin, M. (2009), "Distributed $(Δ + 1)$ -coloring in linear (in $Δ$ ) time", Proceedings of the 41st Symposium on Theory of Computing, pp. 111–120, arXiv:0812.1379, doi:10.1145/1536414.1536432, ISBN 978-1-60558-506-2, S2CID 13446345 Kuhn, F. (2009), "Weak graph colorings: distributed algorithms and applications", Proceedings of the 21st Symposium on Parallelism in Algorithms and Architectures, pp. 138–144, doi:10.1145/1583991.1584032, ISBN 978-1-60558-606-9, S2CID 8857534
E.g. see Leith & Clifford (2006) and Duffy, O'Connell & Sapozhnikov (2008). Leith, D.J.; Clifford, P. (2006), "A self-managed distributed channel selection algorithm for WLAN" (PDF), Proc. RAWNET 2006, Boston, MA, retrieved 2016-03-03 Duffy, K.; O'Connell, N.; Sapozhnikov, A. (2008), "Complexity analysis of a decentralised graph colouring algorithm" (PDF), Information Processing Letters, 107 (2): 60–63, doi:10.1016/j.ipl.2008.01.002
Garey, Johnson & Stockmeyer (1974); Garey & Johnson (1979). Garey, M. R.; Johnson, D. S.; Stockmeyer, L. (1974), "Some simplified NP-complete problems", Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 47–63, doi:10.1145/800119.803884, ISBN 9781450374231, S2CID 207693360 Garey, M. R.; Johnson, D. S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, ISBN 0-7167-1045-5
Dailey (1980). Dailey, D. P. (1980), "Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete", Discrete Mathematics, 30 (3): 289–293, doi:10.1016/0012-365X(80)90236-8
Khuller & Vazirani (1991). Khuller, Samir; Vazirani, Vijay V. (1991-09-30), "Planar graph coloring is not self-reducible, assuming P ≠ NP", Theoretical Computer Science, 88 (1): 183–189, doi:10.1016/0304-3975(91)90081-C, ISSN 0304-3975
Halldórsson (1993). Halldórsson, M. M. (1993), "A still better performance guarantee for approximate graph coloring", Information Processing Letters, 45 (1): 19–23, doi:10.1016/0020-0190(93)90246-6
Zuckerman (2007). Zuckerman, D. (2007), "Linear degree extractors and the inapproximability of Max Clique and Chromatic Number", Theory of Computing, 3 (1): 103–128, doi:10.4086/toc.2007.v003a006
Bulín, Krokhin & Opršal (2019). Bulín, J.; Krokhin, A.; Opršal, J. (2019), "Algebraic approach to promise constraint satisfaction", Proceedings of the 51st Annual ACM SIGACT Symposium on the Theory of Computing, pp. 602–613, arXiv:1811.00970, doi:10.1145/3313276.3316300, ISBN 978-1-4503-6705-9
Jaeger, Vertigan & Welsh (1990). Jaeger, F.; Vertigan, D. L.; Welsh, D. J. A. (1990), "On the computational complexity of the Jones and Tutte polynomials", Mathematical Proceedings of the Cambridge Philosophical Society, 108 (1): 35–53, Bibcode:1990MPCPS.108...35J, doi:10.1017/S0305004100068936, S2CID 121454726
Goldberg & Jerrum (2008). Goldberg, L. A.; Jerrum, M. (July 2008), "Inapproximability of the Tutte polynomial", Information and Computation, 206 (7): 908–929, arXiv:cs/0605140, doi:10.1016/j.ic.2008.04.003, S2CID 53304001
Holyer (1981). Holyer, I. (1981), "The NP-completeness of edge-coloring", SIAM Journal on Computing, 10 (4): 718–720, doi:10.1137/0210055, S2CID 13131049
Crescenzi & Kann (1998). Crescenzi, P.; Kann, V. (December 1998), "How to find the best approximation results – a follow-up to Garey and Johnson", ACM SIGACT News, 29 (4): 90, doi:10.1145/306198.306210, S2CID 15748200
Chaitin (1982). Chaitin, G. J. (1982), "Register allocation & spilling via graph colouring", Proc. 1982 SIGPLAN Symposium on Compiler Construction, pp. 98–105, doi:10.1145/800230.806984, ISBN 0-89791-074-5, S2CID 16872867
Lewis (2021), pp. 221–246, Chapter 8: Designing sports leagues. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Lewis (2021), pp. 203–220, Chapter 7: Designing seating plans. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Lewis (2021), pp. 247–276, Chapter 9: Designing university timetables. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Lewis (2021), pp. 5–6, Section 1.1.3: Scheduling taxis. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Lewis (2021), pp. 172–179, Section 6.4: Latin squares and sudoku puzzles. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465

dx.doi.org

Khuller & Vazirani (1991). Khuller, Samir; Vazirani, Vijay V. (1991-09-30), "Planar graph coloring is not self-reducible, assuming P ≠ NP", Theoretical Computer Science, 88 (1): 183–189, doi:10.1016/0304-3975(91)90081-C, ISSN 0304-3975

hal.science (Global: 2,005^th place; English: 1,689^th place)

inria.hal.science

Lawler (1976). Lawler, E.L. (1976), "A note on the complexity of the chromatic number problem", Information Processing Letters, 5 (3): 66–67, doi:10.1016/0020-0190(76)90065-X

hamilton.ie (Global: low place; English: low place)

E.g. see Leith & Clifford (2006) and Duffy, O'Connell & Sapozhnikov (2008). Leith, D.J.; Clifford, P. (2006), "A self-managed distributed channel selection algorithm for WLAN" (PDF), Proc. RAWNET 2006, Boston, MA, retrieved 2016-03-03 Duffy, K.; O'Connell, N.; Sapozhnikov, A. (2008), "Complexity analysis of a decentralised graph colouring algorithm" (PDF), Information Processing Letters, 107 (2): 60–63, doi:10.1016/j.ipl.2008.01.002

helsinki.fi (Global: 1,384^th place; English: 2,463^rd place)

helda.helsinki.fi

Koivisto (2004), pp. 45, 96–103. Koivisto, Mikko (Jan 2004), Sum-Product Algorithms for the Analysis of Genetic Risks (Ph.D. thesis), Dept. CS Ser. Pub. A, vol. A-2004-1, University of Helsinki, ISBN 952-10-1578-0

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Marx (2004). Marx, Dániel (2004), "Graph colouring problems and their applications in scheduling", Periodica Polytechnica, Electrical Engineering, vol. 48, pp. 11–16, CiteSeerX 10.1.1.95.4268 {{citation}}: Cite uses deprecated parameter |citeseerx= (help)

purdue.edu (Global: 1,391^st place; English: 979^th place)

docs.lib.purdue.edu

Goldberg, Plotkin & Shannon (1988). Goldberg, A. V.; Plotkin, S. A.; Shannon, G. E. (1988), "Parallel symmetry-breaking in sparse graphs", SIAM Journal on Discrete Mathematics, 1 (4): 434–446, doi:10.1137/0401044

rothamsted.ac.uk (Global: low place; English: low place)

repository.rothamsted.ac.uk

Yates (1937), p. 66-67. Yates, F. (1937), The design and analysis of factorial experiments (Technical Communication), Technical Communication No. 35, vol. 35, Harpenden, England: Commonwealth Bureau of Soils

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

api.semanticscholar.org

Brooks (1941). Brooks, R. L. (1941), "On colouring the nodes of a network", Proceedings of the Cambridge Philosophical Society, 37 (2): 194–197, Bibcode:1941PCPS...37..194B, doi:10.1017/S030500410002168X, S2CID 209835194
Scott & Seymour (2020). Scott, Alex; Seymour, Paul (2020), "A survey of $χ$ -boundedness", Journal of Graph Theory, 95 (3): 2–3, doi:10.1002/jgt.22601, S2CID 4760027
Erdős (1959). Erdős, Paul (1959), "Graph theory and probability", Canadian Journal of Mathematics, 11: 34–38, doi:10.4153/CJM-1959-003-9, S2CID 122784453
Beigel & Eppstein (2005). Beigel, R.; Eppstein, D. (2005), "3-coloring in time $O (1.3289 n)$ ", Journal of Algorithms, 54 (2)): 168–204, arXiv:cs/0006046, doi:10.1016/j.jalgor.2004.06.008, S2CID 1209067
Brélaz (1979). Brélaz, D. (1979), "New methods to color the vertices of a graph", Communications of the ACM, 22 (4): 251–256, doi:10.1145/359094.359101, S2CID 14838769
Lewis (2021). Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Barenboim & Elkin (2009); Kuhn (2009). Barenboim, L.; Elkin, M. (2009), "Distributed $(Δ + 1)$ -coloring in linear (in $Δ$ ) time", Proceedings of the 41st Symposium on Theory of Computing, pp. 111–120, arXiv:0812.1379, doi:10.1145/1536414.1536432, ISBN 978-1-60558-506-2, S2CID 13446345 Kuhn, F. (2009), "Weak graph colorings: distributed algorithms and applications", Proceedings of the 21st Symposium on Parallelism in Algorithms and Architectures, pp. 138–144, doi:10.1145/1583991.1584032, ISBN 978-1-60558-606-9, S2CID 8857534
Garey, Johnson & Stockmeyer (1974); Garey & Johnson (1979). Garey, M. R.; Johnson, D. S.; Stockmeyer, L. (1974), "Some simplified NP-complete problems", Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 47–63, doi:10.1145/800119.803884, ISBN 9781450374231, S2CID 207693360 Garey, M. R.; Johnson, D. S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, ISBN 0-7167-1045-5
Jaeger, Vertigan & Welsh (1990). Jaeger, F.; Vertigan, D. L.; Welsh, D. J. A. (1990), "On the computational complexity of the Jones and Tutte polynomials", Mathematical Proceedings of the Cambridge Philosophical Society, 108 (1): 35–53, Bibcode:1990MPCPS.108...35J, doi:10.1017/S0305004100068936, S2CID 121454726
Goldberg & Jerrum (2008). Goldberg, L. A.; Jerrum, M. (July 2008), "Inapproximability of the Tutte polynomial", Information and Computation, 206 (7): 908–929, arXiv:cs/0605140, doi:10.1016/j.ic.2008.04.003, S2CID 53304001
Holyer (1981). Holyer, I. (1981), "The NP-completeness of edge-coloring", SIAM Journal on Computing, 10 (4): 718–720, doi:10.1137/0210055, S2CID 13131049
Crescenzi & Kann (1998). Crescenzi, P.; Kann, V. (December 1998), "How to find the best approximation results – a follow-up to Garey and Johnson", ACM SIGACT News, 29 (4): 90, doi:10.1145/306198.306210, S2CID 15748200
Chaitin (1982). Chaitin, G. J. (1982), "Register allocation & spilling via graph colouring", Proc. 1982 SIGPLAN Symposium on Compiler Construction, pp. 98–105, doi:10.1145/800230.806984, ISBN 0-89791-074-5, S2CID 16872867
Lewis (2021), pp. 221–246, Chapter 8: Designing sports leagues. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Lewis (2021), pp. 203–220, Chapter 7: Designing seating plans. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Lewis (2021), pp. 247–276, Chapter 9: Designing university timetables. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Lewis (2021), pp. 5–6, Section 1.1.3: Scheduling taxis. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Lewis (2021), pp. 172–179, Section 6.4: Latin squares and sudoku puzzles. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Lewis (2021). Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Lewis (2021), pp. 221–246, Chapter 8: Designing sports leagues. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Lewis (2021), pp. 203–220, Chapter 7: Designing seating plans. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Lewis (2021), pp. 247–276, Chapter 9: Designing university timetables. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Lewis (2021), pp. 5–6, Section 1.1.3: Scheduling taxis. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465
Lewis (2021), pp. 172–179, Section 6.4: Latin squares and sudoku puzzles. Lewis, R. M. R. (2021), Guide to Graph Colouring, Texts in Computer Science, Cham: Springer, doi:10.1007/978-3-030-81054-2, ISBN 978-3-030-81053-5, S2CID 57188465

wolfram.com (Global: 1,091^st place; English: 1,169^th place)

mathworld.wolfram.com

Weisstein, Eric W. "Chromatic Number". mathworld.wolfram.com. Retrieved 2025-02-09.
Weisstein, Eric W. "Euler Characteristic". mathworld.wolfram.com. Retrieved 2025-02-09.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Khuller & Vazirani (1991). Khuller, Samir; Vazirani, Vijay V. (1991-09-30), "Planar graph coloring is not self-reducible, assuming P ≠ NP", Theoretical Computer Science, 88 (1): 183–189, doi:10.1016/0304-3975(91)90081-C, ISSN 0304-3975

Graph coloring (English Wikipedia)

acm.org (Global: 1,200th place; English: 821st place)