Abstract
Considering the appointments that teachers plan to teach some courses for specific classes, the problem is to schedule the curriculum such that the time for each teacher is consecutive. In this work, we propose an integer linear programming model to solve consecutive interval edge-coloring of a graph. By using the proposed method, we give the interval edge colorability of some small complete multipartite graphs. Moreover, we find some new classes of complete multipartite graphs that have interval edge-colorings and disprove a conjecture proposed by Grzesik and Khachatrian (2014).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: 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.