Chords in a Longest Cycle of a 3-Connected Graph

Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/7293

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chaudhary, Deepak	-
dc.date.accessioned	2022-03-22T10:19:45Z	-
dc.date.available	2022-03-22T10:19:45Z	-
dc.date.issued	2021-07	-
dc.identifier.citation	18p.	en_US
dc.identifier.uri	http://hdl.handle.net/10263/7293	-
dc.description	Dissertation under the supervision of Dr. Mathew C. Francis	en_US
dc.description.abstract	In 1976, Carsten Thomassen conjectured that no longest cycle in a 3-connected graph can be a chordless cycle. Although this conjecture was later proved for some special classes of graphs, the general case remains open. In this work, we study how Thomason’s Lollipop Method was used by Thomassen to verify this conjecture for cubic graphs.	en_US
dc.language.iso	en	en_US
dc.relation.ispartofseries	Dissertation;;CS-1918	-
dc.subject	Lollipop Method	en_US
dc.subject	Cubic graphs	en_US
dc.subject	Thomason’s model	en_US
dc.title	Chords in a Longest Cycle of a 3-Connected Graph	en_US
dc.type	Other	en_US
Appears in Collections:	Dissertations - M Tech (CS)

Files in This Item:

File	Description	Size	Format
Deepak Chaudhary.pdf		578.61 kB	Adobe PDF	View/Open