Abstract
An equitable partition of a graph G is a partition of the vertex-set of G such that the sizes of any two parts differ by at most one. We show that every graph with an acyclic coloring with at most ...
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
