Mobile Application for Analyzing and Graph Coloring

Abstract

The present topic aims to present a mobile application for graph coloring. A demonstration of creating and vertex coloring of the most commonly used undirected graphs for this purpose is made, and the other functions in the application are also presented. An analysis of the technologies used is made and graphs with three heuristic algorithms for vertex coloring are studied. This paper provides presented and analyzed results from the execution of the algorithms on randomly generated graphs with vertices between 5000 and 10000 (5000, 6000, 7000, 8000, 9000, 10000) with an increasing number in 1000. The obtained results are considered for each graph and the minimum number of colors required for the coloring of the graph is calculated and the execution time is taken into account. In conclusion, it can be seen that the application is user-friendly and optimized for trouble-free operation on a large number of mobile devices. The technologies used allow for viewing results and performing analyses on devices with different screen resolutions and orientations.