Advanced Search

Some results on total chromatic number of a graph

Thumbnail

View/Open

Date

2017-08-24

Author

Vaidya, Samir K.
Isaac, Rakhimol V.

Metadata

Show full item record

Citation

Vaidya, S. K. & Isaac, R. V. (2017). Some results on total chromatic number of a graph. TWMS Journal Of Applied And Engineering Mathematics, 7(2), 332-336.

Abstract

A total coloring of a graph is a proper coloring in which no two adjacent or incident graph elements receive the same color. The total chromatic number of a graph is the smallest positive integer for which the graph admits a total coloring. In this paper, we derive some results on total chromatic number of a graph.

Volume

7

Issue

2

URI

http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2635
http://jaem.isikun.edu.tr/web/index.php/archive/96-vol7no2/309

Collections

The following license files are associated with this item:

info:eu-repo/semantics/openAccess
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess