Abstract
An equitable [Formula: see text]-coloring of a graph [Formula: see text] is a proper vertex coloring such that [Formula: see text] for any [Formula: see text], where [Formula: see text] ([Formula: see text]) is the set of vertices colored with [Formula: see text]. If there is an equitable [Formula: see text]-coloring of [Formula: see text], then the graph [Formula: see text] is said to be equitably [Formula: see text]-colorable. In this paper, we prove that every planar graph without 5-cycles and chordal 4-cycles has an equitable [Formula: see text]-coloring for [Formula: see text] where [Formula: see text] is the maximum degree of [Formula: see text].
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.
