Interval total colorings of bipartite graphs
Petros A. Petrosyan, Ani S. Shashikyan, Arman Yu. Torosyan
Abstract
Petros A. Petrosyan, Ani S. Shashikyan, Arman Yu. Torosyan
Abstract
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 ( ) 1Gd v +
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 ( ) 1Gd v +
Key concepts: Combinatorics, Total coloring, Brooks' theorem, Mathematics, Edge coloring, Complete coloring, Multipartite, Bipartite graph