A CHARACTERIZATION OF UPPER-EMBEDDABLE GRAPHS
A CHARACTERIZATION OF UPPER-EMBEDDABLE GRAPHS
复制标题
DOI：
10.1090/s0002-9947-1978-0492309-3
复制
发表时间：
1978-07
影响因子：
1.3
通讯作者：
M. Jungerman
中科院分区：
文献类型：
--
作者：
M. Jungerman
证明了伪图G是上可嵌入的当且仅当它有一个生成树T使得G-T至多有一个奇数边分支。这个结果被用来证明所有的4-边连通图都是上可嵌入的。
It is proved that a pseudograph G is upper-embeddable if and only if it has a spanning tree T such that G — T has at most one component with an odd number of edges. This result is then used to show that all 4-edge connected graphs are upper-embeddable.