Let $G$ be a simple $3$-regular (every vertex has degree $3$) $2$-edge connected graph. Does $G$ contain a perfect matching?



Does every 3-regular bridgeless graph have a perfect matching?
Every bridgeless cubic graph contains a perfect matching according to [Petersen's Thereom](https://en.wikipedia.org/wiki/Petersen%27s_theorem).


