The spanning subgraphs of eulerian graphs
The spanning subgraphs of eulerian graphs
复制标题
DOI：
10.1002/jgt.3190010115
复制
发表时间：
1977-03
期刊：
影响因子：
--
通讯作者：
F. Boesch;C. Suffel;R. Tindell
中科院分区：
文献类型：
--
作者：
F. Boesch;C. Suffel;R. Tindell
证明了连通图G跨越欧拉图的充要条件是G不被奇完全二重图K(2m+1，2n+1)所跨越。不连通图跨越欧拉图的充要条件是它不是平凡图与奇数阶完全图的并。得到了为了得到欧拉图而必须添加到这类图中的线数的精确公式。
It is shown that a connected graph G spans an eulerian graph if and only if G is not spanned by an odd complete bigraph K(2m + 1, 2n + 1). A disconnected graph spans an eulerian graph if and only if it is not the union of the trivial graph with a complete graph of odd order. Exact formulas are obtained for the number of lines which must be added to such graphs in order to get eulerian graphs.