Raskraska ploskih grafow. Teoriq, metody, algoritmy

V dannoj rabote dokazyvaetsya teorema o sushhestvovanii cvetnogo diska v ploskom kubicheskom grafe, prohodyashhego po dvum sceplennym rjobram, prinadlezhashhim izometricheskomu ciklu ili obodu grafa. Na osnove dokazannoj teoremy predstavleny algoritmy raskraski ploskih kubicheskih grafov v tri cveta. 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.