References
- Euler, L. (1741). Solutio problematis ad geometriam situs pertinentis. MAA Euler Archive. https://scholarlycommons.pacific.edu/euler-works/53/.
- Greenwood, R. E., & Gleason, A. M. (1955). Combinatorial relations and chromatic graphs. Canadian Journal of Mathematics, 7, 1–7. https://doi.org/10.4153/CJM-1955-001-4
- Jungić, V. (2023). Basics of Ramey theory. CRC Press.
- Kalbfleish, J. G., & Stanton, R. G. (1968). On the maximal triangle-free edge-chromatic graphs in three colors. Journal of Combinatorial Theory, 5(1), 9–20. https://doi.org/10.1016/S0021-9800(68)80024-9
- Paoletti, T. (2006). Leonard Euler's solution to the Konigsberg bridge problem. Convergence: A Magazine of the Mathematical Association of America. https://www.maa.org/press/periodicals/convergence/leonard-eulers-solution-to-the-konigsberg-bridge-problem.
- Ramsey, F. P. (1930). On a problem of formal logic. Proceedings of the London Mathematical Society, s2–30(1), 264–286. https://doi.org/10.1112/plms/s2-30.1.264
- West, D. B. (2000). Introduction to graph theory (2nd ed.). Prentice-Hall.