Abstract: Proper edge 3-coloring of a cubic graph is an NP-complete problem, which is present in number of real-live problems − correct and efficient assigning of variables used in the program to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results