1. G. M. Adel'son-Vel'skií, E. A. Dinits, and A. V. Karzanov, Flow Algorithms [in Russian], Nauka, Moscow (1975).
2. A. S. Asratyan and H. K. Khachatryan, ?Two theorems on Hamiltonian graphs,? Mat. Zametki,35, No. 1, 55?61 (1984).
3. O. V. Borodin, ?Proof of B. Grünbaum's conjecture on acyclic 5-colorability of planar graphs,? Dokl. Akad. Nauk SSSR,231, No. 1, 18?20 (1976).
4. O. V. Borodin, ?Solution of the Ringel problem on vertex-face coloring of planar graphs and on the coloring of 1-planar graphs,? Sb. Trudov Inst. Mat. Sib. Otd. Akad. Nauk SSSR,41, 12?26 (1984).
5. V. G. Vizing, ?Coloring of graph vertices with predetermined colors,? Diskretnyi Analiz, No. 29, 3?10 (1976).