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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
