























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$.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。