Unal UfuktepeGoksen Bacak2025-10-0620070167-739X10.1016/j.future.2006.10.011http://dx.doi.org/10.1016/j.future.2006.10.011https://gcris.yasar.edu.tr/handle/123456789/6673This 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. (c) 2006 Elsevier B.V. All rights reserved.Englishgraph coloring, vertex coloring, edge coloring, chromatic number, mathematicaNEURAL-NETWORKSArticle