Interval Total Colorings of Bipartite Graphs

An interval total t coloring of a graph G is a total coloring of with colors 1, such that at least one vertex or edge of is colored by color − G 2, ,t… G , 1, 2, ,i i t= … , and the edges incident to each vertex together with are colored by consecutive colors, where is the degree of the vertex in . In this paper interval total colorings of bipartite graphs are investigated. ( )v V G∈ v ( ) 1G d v + ( )G d v v G Keywords Total coloring, interval edge coloring, interval total coloring, bipartite graph.

• Type: Journal
• Year: 2010
• Where: COLOGNETWENTE
• Authors: Petros A. Petrosyan, Ani Shashikyan, Arman Yu. Torosyan
• Keywords: COLOGNETWENTE 2010, Edges Incident, Interval Total, Optimization, Total Coloring