On Cyclically Continuous Edge Colorings of Trees
Abstract
A cyclically continuous edge coloring of a graph is defined. For an arbitrary tree the existence of this coloring is proved and all possible numbers of colors in such colorings are found.
References
F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
Vizing V.G., "The chromatic index of a multigraph", (in Russian), Kibernetika No. 3, Kiev, pp. 29-39, 1965.
R.R. Kamalian, Interval Edge Colourings of Graphs, Doctoral Dissertation, Institute of Mathematics of the Siberian Branch of the Academy of Sciences of USSR, Novosibirsk, 1990.
A.S. Asratian, R.R. Kamalian, "Interval edge colouring of multigraphs", Appl. Math., Yerevan Univ., vol. 5, pp. 25-34, 1987, (in Russian).
R.R. Kamalian, "Interval colourings of complete bipartite graphs and trees", (in Russian), Preprint of the Computing Centre of the Academy of Sciences of Armenia, Yerevan, 1989.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
