2000 character limit reached
On The 2-Spanning Cyclability Of Honeycomb Toroidal Graphs
Published 10 Sep 2023 in math.CO | (2309.04938v1)
Abstract: A graph $X$ is 2-spanning cyclable if for any pair of distinct vertices $u$ and $v$ there is a 2-factor of $X$ consisting of two cycles such that $u$ and $v$ belong to distinct cycles. In this paper we examine the 2-spanning cyclability of honeycomb toroidal graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
