Edge Constrained Eulerian Extensions
Ghurumuruhan Ganesan · arXiv (Cornell University) · 2023
In this paper we study Eulerian extensions with edge constraints and use the probabilistic method to establish sufficient conditions for a given connected graph to be a subgraph of a Eulerian graph containing $m$ edges, for a given number $m$.