Word-Representability of Graphs via Split Decomposition

dc.contributor.author	Dwary, Tithi
dc.date.accessioned	2026-07-23T09:55:58Z
dc.date.issued	2026
dc.description	krishna, K V
dc.description.abstract	The theory of word-representable graphs lies at the intersection of graph theory and combinatorics on words. This thesis uses a graph decomposition technique, viz., split decomposition, to study the theory of word representable graphs. Further, the thesis constructs minimum-word-representants for certain classes of graphs.
dc.identifier.other	ROLL NO.216123014
dc.identifier.uri	https://gyan.iitg.ac.in/handle/123456789/3292
dc.language.iso	en
dc.relation.ispartofseries	TH-4106
dc.rights	https://creativecommons.org/licenses/by-nc-sa/4.0/
dc.rights.uri	https://creativecommons.org/licenses/by-nc-sa/4.0/
dc.title	Word-Representability of Graphs via Split Decomposition
dc.type	Thesis