From analyzing the characters of depth first search algorithm， we proposed a new map coloring algorithm. The proposed algorithm overcomes the disadvantage of other algorithms in the field of Map-coloring, and the results show that the proposed algorithms can solve the problem of coloring administrative map efficiently and obtain optimal solutions
Many linear-time graph algorithms using depth-first search have been invented. We propose simplified versions of two such algorithms, for computing a bipolar orientation or st-numbering of an undirected graph and for finding all feedback vertices of a directed graph.
Depth-first Search Approach for Language-based Opacity Verification Using Petri Nets
