Abstract
A proper vertex coloring of a graph is called equitable if the sizes of colour classes differ by at most 1. In this paper, we find the minimum number l=l(d, Δ) such that every d-degenerate graph with maximum degree at most Δ admits an equitable t-colouring for every t[ges ]l when Δ[ges ]27d.
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.
