Edge coloring strategy I found the best edge coloring for the next two graphs.
But is there some strategy for it?


 A: The main observation is that the edge-chromatic number will be at least the maximum degree, i.e., $\chi'(G) \geq \Delta(G)$, simply because each edge incident with a maximum-degree vertex must have different colors.  In fact, Vizing's Theorem goes further and says $$\chi'(G) \in \{\Delta(G),\Delta(G)+1\}.$$
The first graph achieves $\chi'(G)=\Delta(G)$ (meaning it's class one), as you demonstrate.  There's theoretical results which imply this, e.g., the Wikipedia page for Vizing's Theorem states "Vizing (1965) showed that a planar graph is of class one if its maximum degree is at least eight."
The second graph (the Petersen graph) is not class one.
There's not going to be an efficient algorithm for this in general, since there's various NP-completeness results, e.g. Leven and Galil, NP completeness of finding the chromatic index of regular graphs, 1983.


*

*In the given examples, the most difficult task is proving $\chi'(G) \neq \Delta(G)$ in the Petersen graph, since it requires effort to check it can't be $3$-edge-colored.

*A greedy-like algorithm would likely work in practice to give a $\chi'(G)$-edge coloring; generally, when there's one coloring, there's zillions of others.
