Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/7293| Title: | Chords in a Longest Cycle of a 3-Connected Graph |
| Authors: | Chaudhary, Deepak |
| Keywords: | Lollipop Method Cubic graphs Thomason’s model |
| Issue Date: | Jul-2021 |
| Citation: | 18p. |
| Series/Report no.: | Dissertation;;CS-1918 |
| 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. |
| Description: | Dissertation under the supervision of Dr. Mathew C. Francis |
| URI: | http://hdl.handle.net/10263/7293 |
| 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 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.