Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorVaidya, Samir K.en_US
dc.contributor.authorIsaac, Rakhimol V.en_US
dc.date.accessioned2020-10-13T10:31:37Z
dc.date.available2020-10-13T10:31:37Z
dc.date.issued2017-08-24
dc.identifier.citationVaidya, 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.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2635
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/96-vol7no2/309
dc.description.abstractA 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.sponsorshipThe 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.isoenen_US
dc.publisherIşık University Pressen_US
dc.relation.ispartofTWMS Journal Of Applied And Engineering Mathematicsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectTotal coloringen_US
dc.subjectTotal chromatic numberen_US
dc.subjectSplitting graphen_US
dc.titleSome results on total chromatic number of a graphen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume7
dc.identifier.issue2
dc.identifier.startpage332
dc.identifier.endpage336
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

info:eu-repo/semantics/openAccess
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess