Edge Constrained Eulerian Extensions
Combinatorics
2023-01-16 v1
Abstract
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 edges, for a given number .
Cite
@article{arxiv.2301.05383,
title = {Edge Constrained Eulerian Extensions},
author = {Ghurumuruhan Ganesan},
journal= {arXiv preprint arXiv:2301.05383},
year = {2023}
}
Comments
Accepted for presentation in 8th International Conference on Mathematics and Computing (ICMC 2022), VIT Vellore and published in Springer Proceedings in Mathematics and Statistics