Unal UfuktepeGoksen BacakUfuktepe, UnalBacak, Goksen2025-10-0620070167739X0167-739X1872-711510.1016/j.future.2006.10.0112-s2.0-33947278898https://www.scopus.com/inward/record.uri?eid=2-s2.0-33947278898&doi=10.1016%2Fj.future.2006.10.011&partnerID=40&md5=e17e8cb874c5c1d000a0db6cd208598ahttps://gcris.yasar.edu.tr/handle/123456789/10372https://doi.org/10.1016/j.future.2006.10.011This paper analyzes some graph issues by using the symbolic program Mathematica and its version for the Web webMathematica. In particular we consider the problem of graph coloring: the assignment of colors to the vertices/edges of the graph such that adjacent vertices/edges are colored differently. In addition we address the problem of obtaining the tenacity of binomial trees with Mathematica. Finally we describe briefly an example of the application of our software to a scheduling problem. © 2006 Elsevier Ltd. All rights reserved. © 2008 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/openAccessChromatic Number, Edge Coloring, Graph Coloring, Mathematica, Vertex Coloring, Coloring, Computer Science, Computer Software, Mathematical Programming, Problem Solving, Binomial Trees, Graph Coloring, Mathematica (software), Scheduling Problem, Symbolic Program, Graph TheoryColoring, Computer science, Computer software, Mathematical programming, Problem solving, Binomial trees, Graph coloring, Mathematica (software), Scheduling problem, Symbolic program, Graph theoryChromatic NumberGraph ColoringEdge ColoringVertex ColoringMathematicaArticle