Simply sequentially additive labelings of 2-regular graphs

We conjecture that any 2-regular simple graph has an SSA labeling. We provide several special cases to support our conjecture. Most of our constructions are based on Skolem sequences and on an extension of it. We establish a connection between simply sequentially additive labelings of 2-regular graphs and ordered graceful labelings of spiders.