Exploring Edge Colouring Techniques for Topological Graphs Using Adjacency Matrices
Keywords:
Adjacency matrix, Chromatic Index, Edge colouring, Graph Colouring, Topological graph.Abstract
Edge colouring is a well-established problem in graph theory, where the goal is to assign colours to the edges of a graph such that no two adjacent edges share the same colour. This paper focuses on edge colouring in topological graphs through the lens of edge adjacency matrices. The objective of this study is to investigate how edge adjacency matrices can be utilized to enhance the efficiency and understanding of the edge colouring process in topological graphs, which are often used to model complex systems in fields such as network theory and computational biology.
References
Appel, K., & Haken, W. (1977). Every planar map is four colorable. Scientific American, 236(4), 108-121.
Baker, B., Bernhart, F., & Karger, M. (2013). Improved edge coloring techniques for multigraphs. Journal of Graph Theory, 72(1), 123-145.
De Grey, A. (2000). Geometrically constrained edge coloring. Journal of Computational Geometry, 12(3), 135-148.
