Article
Hamilton Cycles in Bidirected Complete Graphs
Contributions to Discrete Mathematics
Document Type
Article
Publication Date
12-19-2022
Disciplines
Abstract
Zaslavsky observed that the topics of directed cycles in directed graphs and alternating cycles in edge 2-colored graphs have a common generalization in the study of coherent cycles in bidirected graphs. There are classical theorems by Camion, Harary and Moser, Häggkvist and Manoussakis, and Saad which relate strong connectivity and Hamiltonicity in directed "complete" graphs and edge 2-colored "complete" graphs. We prove two analogues to these theorems for bidirected "complete" signed graphs.
Citation Information
Arthur Busch, Mohammed A Mutar and Daniel Slilaty. "Hamilton Cycles in Bidirected Complete Graphs" Contributions to Discrete Mathematics Vol. 17 Iss. 2 (2022) p. 137 - 149 ISSN: 1715-0868 Available at: http://works.bepress.com/dan_slilaty/33/
This work is licensed under CC BY-ND 4.0![](https://mirrors.creativecommons.org/presskit/icons/cc.svg?ref=chooser-v1)
![](https://mirrors.creativecommons.org/presskit/icons/by.svg?ref=chooser-v1)
![](https://mirrors.creativecommons.org/presskit/icons/nd.svg?ref=chooser-v1)