On special edge 2-coloring of bipartite grap

Mathematical Modelling: Methods, algorithms, technologies
Authors:
Abstract:

For bipartite graph G = (X, Y, E), where the degree of any vertex in X is equal to 2, the conditions for the existence of special type edge-coloring are considered