CLASS OF UPPER-EMBEDDABLE GRAPHS

被引：11
作者：
JAEGER, F
PAYAN, C
XUONG, NH
机构：
[1] I.M.A.G, Grenoble
来源：
JOURNAL OF GRAPH THEORY | 1979年 / 3卷 / 04期
关键词：
D O I：
10.1002/jgt.3190030409
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we prove the following result: Every graph obtained by connecting (with any number of edges) two vertex‐disjoint upper‐embeddable graphs graphs with even Betti number is upper‐embeddable. Copyright © 1979 Wiley Periodicals, Inc., A Wiley Company
引用
收藏
页码：387 / 391
页数：5
相关论文
共 9 条
[1]  
Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364
[2]  
JAEGER F, 1974, 5TH P SE C COMB GRAP, P501
[3]  
Nordhaus E.A., 1971, J COMBINATORIAL TH B, V11, P258
[4]  
ORE O, 1967, 4 COLOR PROBLEM, pCH3
[5]  
Ringeisen R.D., 1972, J COMB THEORY, V12, P101
[6]  
RINGEISEN RD, 1972, GRAPH THEORY APPLICA, P261
[7]  
XUONG NH, 1979, J COMB THEORY B, V26, P217, DOI 10.1016/0095-8956(79)90058-3
[8]  
XUONG NH, 1979, J COMB THEORY B, V26, P226, DOI 10.1016/0095-8956(79)90059-5
[9]  
XUONG NH, 1977, THESIS U GRENOBLE, pCH4
1