Verifying the Neighbouring k-edge Coloration Technique for Bipartite Graphs

This paper focuses on verifying the neighbouring k-edge coloration technique for balancing multi-color problems in the bipartite graph. Thus, it eliminates triangular copies of similar colour shades while maintaining exactly two colours spacing between the edges. It is achieved by inducing bipartite color selections from two unique color sets say and . Thus, ensures the minimum colour interference exists by employing a fair version of the neighbouring k-edge colouring technique. Theoretical evidence, theorems, and proofs are discussed, and results shows the superiority for equitable colourable of Wi-Fi applications