On The 2-Spanning Cyclability Of Honeycomb Toroidal Graphs
Brian Alspach, Aditya Joshi

TL;DR
This paper investigates the 2-spanning cyclability property of honeycomb toroidal graphs, exploring conditions under which any two vertices can be separated into two cycles within a 2-factor.
Contribution
The paper provides a detailed analysis of 2-spanning cyclability in honeycomb toroidal graphs, a specific class of graphs, which was not previously studied in this context.
Findings
Characterization of 2-spanning cyclability in honeycomb toroidal graphs
Conditions for the existence of 2-factors with two cycles separating any two vertices
New theoretical results on the structure of honeycomb toroidal graphs
Abstract
A graph is 2-spanning cyclable if for any pair of distinct vertices and there is a 2-factor of consisting of two cycles such that and belong to distinct cycles. In this paper we examine the 2-spanning cyclability of honeycomb toroidal graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Optimization and Search Problems · Advanced Graph Theory Research
