INTERVAL NON-TOTAL COLORABLE GRAPHS
DOI:
https://doi.org/10.46991/PYSU:A/2015.49.3.037Keywords:
total coloring, interval total coloring, interval coloringAbstract
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 interval total $t$-coloring of a graph $G$ is a total coloring of $G$ with colors $1,2,\ldots,t$ such that all colors are used, 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 a vertex $v$ in $G$. In this paper we describe some methods for constructing of graphs that have no interval total coloring.
Downloads
Published
2015-12-15
How to Cite
Khachatryan, N. (2015). INTERVAL NON-TOTAL COLORABLE GRAPHS. Proceedings of the YSU A: Physical and Mathematical Sciences, 49(3 (238), 37–41. https://doi.org/10.46991/PYSU:A/2015.49.3.037
Issue
Section
Informatics
License
Copyright (c) 2015 Proceedings of the YSU
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.