Raskraska ploskih grafov. Teoriya, metody, algoritmy

V dannoj rabote dokazywaetsq teorema o suschestwowanii cwetnogo diska w ploskom kubicheskom grafe, prohodqschego po dwum sceplennym röbram, prinadlezhaschim izometricheskomu ciklu ili obodu grafa. Na osnowe dokazannoj teoremy predstawleny algoritmy raskraski ploskih kubicheskih grafow w tri cweta. Kurapov S. V., Davidovsky M. V. The Coloring of Plane Graphs. Theory, Methods and Algorithms. In this monography we prove a theorem on the existence of a colored disk passing through the two linked edges belonging to an isometric cycle or a rim in a plane cubic graph. On the basis of the proved theorem the algorithms of planar graphs edge coloring with three colors are presented.