Strong coloring 2-regular graphs: Cycle restrictions and partial colorings

Jessica McDonald, Gregory J. Puleo

Let $H$ be a graph with $\Delta (H)\le 2$, and let $G$ be obtained from $H$ by gluing in vertex-disjoint copies of $K_4$. We prove that if $H$ contains at most one odd cycle of length…