1. Facebook, NY, United States;2. Indian Institute of Technology, Delhi, India;3. Simons Institute for the Theory of Computing, UC Berkeley, United States
Abstract:
For a 3-edge-connected cubic graph , we give an algorithm to construct a connected Eulerian subgraph of using at most edges.