EXTENSIONS ON 2-EDGE CONNECTED 3-REGULAR UP-EMBEDDABLE GRAPHS

被引：2

作者：

黄元秋

刘彦佩

机构：

来源：

Acta Mathematicae Applicatae Sinica(English Series) | 1998年 / 04期

关键词：

Graph; surface; Betti number; up-embeddability;

D O I：

暂无

中图分类号：

O157.5 [图论];

学科分类号：

070104 ;

摘要：

It is known[5] that an investigation of the up-embeddability of the 3-regular graphs shows a useful approach to that of the general graph. But as far, very few characterizations of the upembeddability are known on the 3-regular graphs. Let G be a 2-edge connected 3-regular graph.We prove that G is up-embeddable if and only if G can be obtained from the graphs θ, θ or K4by a series of M- or N-extensions. Meanwhile, we also present a new structural characterization of such graph G provided that G is up-embeddable.

引用

页码：337 / 346

页数：10

共 6 条

[1]

On the Maximum Genus of a Graph. E.A. Nordhaus,B.M. Stewart and A.T. White. Journal of Combinatorial Theory . 1971

[2]

The Maximum Genus of a Graph and Doubly Eulerian Trains.Bolletion U. M. Skoviera and S. Nedela. M. I . 1990

[3]

Embeddability in Graphs. Y. Liu. . 1995

[4]

Graph Theory with Applications. J .A. Bondy and U.S.R. Murty. . 1976

[5]

A New Characterization of the Maximum Genus of a Graph. L. Nebesky. Czechoslovak Mathematical Journal . 1981

[6]

Upper Embeddability and Connectivity of Graphs. C. Payan and N.H. Xoung. Discrete Mathematics . 1979

← 1 →