Abstract
A new approach is presented for finding a chromatic partition of the nodes of an arbitrary, finite, connected, linear graph. Based on this approach, three algorithms are presented which require much less enumeration than conventional procedures. In fact, hand computation time is reduced from hours to minutes.
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.
