MbrlCatalogueTitleDetail

Do you wish to reserve the book?
On Square Paths
On Square Paths
Hey, we have placed the reservation for you!
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
On Square Paths
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Title added to your shelf!
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
On Square Paths
On Square Paths

Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
How would you like to get it?
We have requested the book for you! Sorry the robot delivery is not available at the moment
We have requested the book for you!
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
On Square Paths
Dissertation

On Square Paths

2026
Request Book From Autostore and Choose the Collection Method
Overview
In graph theory, a square path is a path in which each vertex is adjacent to the vertices two places ahead and behind. A square cycle is defined analogously. A path or cycle is Hamilton in a graph G if it includes every vertex of G. Pósa conjectured that every graph with minimum degree at least 2/3 its order has a Hamilton square cycle. This dissertation presents a proof of Pósa’s conjecture for graphs on at least 62,000 vertices, an improvement over the previous state of the art. I also explore some auxiliary questions that emerge naturally when exploring square paths. For example, it turns out that there exists a natural analogue of a component, called a triangle component, that seems to describe connectivity by square paths. This dissertation includes some initial results regarding triangle components and suggests avenues for further research. Also, one might seek to rearrange a square path using prefix reversals, and this leads to a novel combinatorial problem concerning prefix reversals of binary and quaternary strings. This dissertation presents a complete result for the binary case and some initial results for the quaternary case.
Publisher
ProQuest Dissertations & Theses
ISBN
9798277438657