Interval total colorings of graphs

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Additional info

23 pages, 1 figure

Type

Scientific paper

Abstract

A total coloring of a graph $G$ is a coloring of its vertices and edges such that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. An \emph{interval total $t$-coloring} of a graph $G$ is a total coloring of $G$ with colors $1,2,\...,t$ such that at least one vertex or edge of $G$ is colored by $i$, $i=1,2,\...,t$, and the edges incident to each vertex $v$ together with $v$ are colored by $d_{G}(v)+1$ consecutive colors, where $d_{G}(v)$ is the degree of the vertex $v$ in $G$. In this paper we investigate some properties of interval total colorings. We also determine exact values of the least and the greatest possible number of colors in such colorings for some classes of graphs.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Interval total colorings of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Interval total colorings of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interval total colorings of graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-286291

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.