Abstract
An edge-colouring of a graph G is equitable if, for each vertex v of G, the number of edges of any one colour incident with v differs from the number of edges of any other colour incident with v by at most one. We show that if k⩾2 and k∤d(v) (∀vϵV(G)) and G is a simple graph, then G has an equitable edge-colouring with k colours. This result is also extended to one about I-regular edge-colourings of simple graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
