The graph coloring problem used to solve region coloring in maps is now widely used in various fields such as workflow, register location, bioinformatics, route optimization, and scheduling. GCPs are usually the initial solution in theoptimization process. A heuristic approach is applied to obtain a fast and precise initial solution. This research will comparethe performance and look for the potential development of heuristic methods such as Saturation degree (SD), Largest Degree (LD), Welsh and Powell (WP), First Fit (FF), Incidence Degree Ordering (IDO), and Recursive Largest First (RLF)using DCIMS data. The development is to intersect the coloring results of the two heuristic algorithms that will be the toppriority to be colored. The results will be compared to the quality of the minimum color solution and computation time. Based on the results found, by using intersection information, the color obtained is minimal than without intersection, even though the computation time is much longer. © 2024 Author(s).