Skip to main content
SpringerLink
Log in

Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature cited

  1. V. G. Vizing, “A bound on the chromatic number of a graph,” Diskret. Analiz., No. 3, 25–30 (1964).

    Google Scholar 

  2. J. Holyer, “The NP-completeness of edge-coloring,” SIAM J. Comput.,10, 718–720 (1981).

    Google Scholar 

  3. V. G. Vizing, “Critical graphs with a given chromatic class,” Diskret. Analiz., No. 5, 9–17 (1965).

    Google Scholar 

  4. V. G. Vizing, “Coloring the vertices of a graph in prescribed colors,” Diskret. Analiz., No. 29, 3–10 (1976).

    Google Scholar 

  5. P. Erdös, A. L. Rubin, and H. Taylor, “Choosability in graphs,” in: Proceedings of the West Coast Conference on Combinatorics, Graph Theory, and Computing, Humboldt State University, Arcata, Calif. (1979), pp. 125–127.

    Google Scholar 

  6. B. Bollobás and A. J. Harris, “List-coloring of graphs,” Graphs and Combinatorics,1, 115–127 (1985).

    Google Scholar 

  7. A. Kotzig, “Contribution to the theory of Eulerian polyhedra,” Mat.-Fyz. Časopis. Slovensk. Akad. Vied,5, 101–113 (1955).

    Google Scholar 

  8. B. Grünbaum, “New views on some old questions of combinatorial geometry,” in: Colloquio Internazionale sulle Theorie Combinatorie (Rome, 1973), Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome (1976), pp. 451–468.

    Google Scholar 

  9. M. Bezhad, G. Chartrand, and J. Cooper, “The coloring numbers of complete graphs,” J. London Math. Soc.,42, 226–228 (1967).

    Google Scholar 

  10. V. G. Vizing, “Some unsolved problems in graph theory,” Usp. Mat. Nauk,23, 117–134 (1968).

    Google Scholar 

  11. A. V. Kostochka, “An exact upper bound on the total chromatic number of multigraphs,” in: Theorie des Graphen und Netzwerke, 24th Internat. Wiss. Koll., Ilmenau (1979), pp. 33–36.

  12. H. Kronk and J. Mitchem, “A seven-color theorem on the sphere,” Discrete Math.,5, 253–260 (1973).

    Google Scholar 

  13. O. V. Borodin, “Solution of the Ringel problem on vertex-face coloring of planar graphs and coloring of 1-planar graphs,” Metody Diskret. Analiz, No. 41, 12–26 (1984).

    Google Scholar 

  14. O. V. Borodin, “Joint colorings of graphs in the plane,” Metody Diskret. Analiz., No. 45, 21–27 (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Institute of the Siberian Section of the Academy of Sciences of the USSR, USSR

    O. V. Borodin

Authors
  1. O. V. Borodin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Mathematicheskie Zametki, Vol. 48, No. 6, pp. 22–28, December, 1990.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borodin, O.V. Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs. Mathematical Notes of the Academy of Sciences of the USSR 48, 1186–1190 (1990). https://doi.org/10.1007/BF01240258

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01240258

Keywords

Search

Navigation