Some Simplification of Complete System of Transformations for Proper Edge Colourings of Bipartite Graphs

Authors

  • Alisa K. Mirumyan Institute for Informatics and Automation Problems of NAS RA

Abstract

In the investigation of a set of combinatorial objects, an important problem is to find a complete system of transformations. In this article a set of (k+1)-colourings of an arbitrary bipartite graph are considered. It is prooved that 2-transformation is a complete system of transformations for this type of set.

References

A. S. Asratian and A. N. Mirumyan, Transformation of Edge Colourings of a bipartite multigraph, and their applications, Soviet Math. Dokl. Vol. 43, 1991.

F. Harary, Graph theory, Addison-Wesley, 1969.

A. S. Asratian, Tristan M. J. Denley & R. Haggkvist, Bipartite graphs and their applications, Cambridge University, 1998.

A. S. Asratian and A. N. Mirumyan, On transformations of edge colourings of the complete bipartite graph Knn., Akad. Nauk Respub. Armenia Dokl. 95, 1995.

Downloads

Published

2004-05-26

How to Cite

Mirumyan, A. K. (2004). Some Simplification of Complete System of Transformations for Proper Edge Colourings of Bipartite Graphs. Mathematical Problems of Computer Science, 23, 32–35. Retrieved from http://93.187.165.2/index.php/mpcs/article/view/584

Issue

Vol. 23 (2004): Mathematical Problems of Computer Science

Section

Articles

License

Creative Commons License

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