ADDITIVITY THEOREM FOR MAXIMUM GENUS OF A GRAPH

被引：4

作者：

LITTLE, CHC

RINGEISEN, RD

机构：

[1] INDIANA UNIV,FT WAYNE,IN 46805

[2] PURDUE UNIV,FT WAYNE,IN 46805

来源：

DISCRETE MATHEMATICS | 1978年 / 21卷 / 01期

关键词：

D O I：

10.1016/0012-365X(78)90148-6

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a finite, connected graph with no loops or multiple edges. If G is the union of two blocks, then a necessary and sufficient condition is given for the maximum genus of G to be the sum of the maximum genera of its blocks. If in addition the blocks of G are upper embeddable, then a necessary and sufficient condition is given for the upper embeddability of G. © 1978.

引用

页码：69 / 74

页数：6