Total coloring of quasi-line graphs and inflated graphs

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2019

Full metadata record

DC Field	Value	Language
dc.contributor.author	S Mohan
dc.contributor.author	Geetha
dc.contributor.author	K Somasundaram
dc.date.accessioned	2022-05-26T05:23:28Z	-
dc.date.available	2022-05-26T05:23:28Z	-
dc.date.issued	2020
dc.identifier.citation	Discrete mathematics, algorithms and applications
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/2019	-
dc.description.abstract	A total coloring of a graph is an assignment of colors to all the elements (vertices and edges) of the graph such that no two adjacent or incident elements receive the same color. A claw-free graph is a graph that does not have K1,3K1,3 as an induced subgraph. Quasi-line and inflated graphs are two well-known classes of claw-free graphs. In this paper, we prove that the quasi-line and inflated graphs are totally colorable. In particular, we prove the tight bound of the total chromatic number of some classes of quasi-line graphs and inflated graphs.
dc.format.extent	1 (11)
dc.language.iso	en
dc.publisher	World Scientific Publishing Co. Pte Ltd
dc.title	Total coloring of quasi-line graphs and inflated graphs
dc.type	Article
Appears in Collections:	Mathematics Department

Files in This Item:

File	Size	Format
SOE-Mathematics-17.pdf	107.23 kB	Adobe PDF	View/Open

DSpace JSPUI