Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Articles Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Further Results on the 3-Consecutive Vertex Coloring Number of Certain Graphs Subject The topic of the resource 3-consecutive vertex coloring; 3-consecutive vertex coloring number; corona product; necklace graphs; snake graphs Description An account of the resource A 3-consecutive vertex coloring is an assignment of colors on vertices of a graph G such that for any 3-consecutive vertices a, b and c, the color of b is the same as the color of a or c. ? 3c(G) denotes the maximum number of colors that can be used to 3-consecutive vertex color a graph G. The main aim of this article is to give the value of ? 3c(G) for some particular types of graphs, which includes: necklace graphs; the Cartesian product of two paths, a cycle and a path, and two cycles; the corona product of a path and a clique; Mobius Ladder graphs; the 3rd edge line graph; triangular snake graphs, double triangular snake graphs, triple triangular snake graphs, quadrilateral snake graphs and the alternative versions of them; Hanoi graphs; Sun graphs; Barbel graphs; the n-pan graph. The objective of this article is to explore some important results on ? 3c(G). 2024 The Authors. Creator An entity primarily responsible for making the resource John D.; Dominic C.; Vallikavungal J. Source A related resource from which the described resource is derived IEEE Access, Vol-12, pp. 144164-144173. Publisher An entity responsible for making the resource available Institute of Electrical and Electronics Engineers Inc. Date A point or period of time associated with an event in the lifecycle of the resource 2024-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1109/ACCESS.2024.3471858" target="_blank" rel="noreferrer noopener">https://doi.org/10.1109/ACCESS.2024.3471858</a> <br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85205852697&amp;doi=10.1109%2FACCESS.2024.3471858&amp;partnerID=40&amp;md5=0c90e21d9da37b849b1e54228994c6e0" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85205852697&amp;doi=10.1109%2fACCESS.2024.3471858&amp;partnerID=40&amp;md5=0c90e21d9da37b849b1e54228994c6e0</a> Rights Information about rights held in and over the resource All Open Access; Gold Open Access Relation A related resource ISSN: 21693536 Format The file format, physical medium, or dimensions of the resource Online Language A language of the resource English Type The nature or genre of the resource Article Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant John D., Christ University, Department of Mathematics, Bengaluru, 560029, India; Dominic C., Christ University, Department of Mathematics, Bengaluru, 560029, India; Vallikavungal J., Tecnologico de Monterrey, School of Engineering and Sciences, Monterrey, 64849, Mexico