Some results on total chromatic number of a graph

Vaidya, Samir K.; Isaac, Rakhimol V.

dc.contributor.author	Vaidya, Samir K.	en_US
dc.contributor.author	Isaac, Rakhimol V.	en_US
dc.date.accessioned	2020-10-13T10:31:37Z
dc.date.available	2020-10-13T10:31:37Z
dc.date.issued	2017-08-24
dc.identifier.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.	en_US
dc.identifier.issn	2146-1147
dc.identifier.issn	2587-1013
dc.identifier.uri	https://hdl.handle.net/11729/2635
dc.identifier.uri	http://jaem.isikun.edu.tr/web/index.php/archive/96-vol7no2/309
dc.description.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.	en_US
dc.description.sponsorship	The present work is a part of the research work done under the Minor Research Project No. GUJCOST/MRP/2015-16/2620 of Gujarat Council on Science and Technology(GUJCOST).	en_US
dc.language.iso	eng	en_US
dc.publisher	Işık University Press	en_US
dc.rights	info:eu-repo/semantics/openAccess	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	Total coloring	en_US
dc.subject	Total chromatic number	en_US
dc.subject	Splitting graph	en_US
dc.title	Some results on total chromatic number of a graph	en_US
dc.type	article	en_US
dc.description.version	Publisher's Version	en_US
dc.relation.journal	TWMS Journal Of Applied And Engineering Mathematics	en_US
dc.identifier.volume	7
dc.identifier.issue	2
dc.identifier.startpage	332
dc.identifier.endpage	336
dc.peerreviewed	Yes	en_US
dc.publicationstatus	Published	en_US
dc.relation.publicationcategory	Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı	en_US