CONSTRUCTIVE ALGORITHM FOR COLORING CUBIC GRAPHS

Authors

  • S. V. Kurapov Zaporizhzhya National University, Ukraine

DOI:

https://doi.org/10.15588/1607-3274-2007-2-14

Abstract

The constructive algorithm for coloring the cubic graph with using the theory of the tops’ rotation is presented. The algorithm is founded on the fundamental Petersen’s theorem of separations of 1-factors and 2-factors in the cubic graphs.

Author Biography

S. V. Kurapov, Zaporizhzhya National University

Candidate of Physical and Mathematical Sciences, Associate Professor

References

Donets N. G., Shor N. Z. Algebraicheskiy podkhod k probleme raskraski ploskikh grafov – K.: Nauk. dumka, 1982. – 144 s.

Appel K., Haken W. Every Planar Map Is Four Colorable // Contemporary Mathematics. – Providence (R.I.): Amer. Math Soc., 1989. – Vol. 98. – P. 308.

Samokhin A. V. Problema chetyrekh krasok: Neokonchennaya teoriya dokazatel'stva // Sorovskiy obrazovatel'skiy zhurnal. – 2001. – T. 6, № 7. – C. 91–96.

Uezerell CH. Etyudy dlya programmistov: Per. s angl. – M: Mir. – 1982. – 288 s.

Kurapov S. V., Perepelitsa V. A. Identitsikatsiya risunka grafa na ploskosti // Aktual'nyye problemy razvitiya obshchestvennoy mysli i praktiki upravleniya: Sbornik nauchnykh trudov. – Zaporozhskiy institut gosudarstvennogo i munitsipal'nogo upravleniya. – 1996. – Vyp.2. – S. 225–232.

Kharari F. Teoriya grafov: Per. s angl. Kozyreva V. P. / Pod red. Gavrilova V. G. – M.: Mir, 1973. – 300 s.

Ringel' G. Teorema o raskraske kart. – M.: Mir. – 1977. – 126 s.

Kurapov S. V., Savin V. V. Vektornaya algebra i risunok grafa. – Zaporozh'ye: ZGU, 2003. – 200 s.

Downloads

Published

2024-11-19

How to Cite

Kurapov, S. V. (2024). CONSTRUCTIVE ALGORITHM FOR COLORING CUBIC GRAPHS. Radio Electronics, Computer Science, Control, (2), 69. https://doi.org/10.15588/1607-3274-2007-2-14

Issue

No. 2 (2007): Radio Electronics, Computer Science, Control

Section

Mathematical and computer modelling

License

Copyright (c) 2014 S. V. Kurapov

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Creative Commons Licensing Notifications in the Copyright Notices

The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.

The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.

The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.