Abstract
An edge-coloring of a graph G with colors 1 , 2 , … , t is called an interval ( t , 1 ) -coloring if at least one edge of G is colored by i , i = 1 , 2 , … , t , and the colors of edges incident to each vertex of G are distinct and form an interval of integers with no more than one gap. In this paper we investigate some properties of interval ( t , 1 ) -colorings. We also determine exact values of the least and the greatest possible number of colors in such colorings for some families of graphs.
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.
