FINDING NONSEPARATING INDUCED CYCLES AND INDEPENDENT SPANNING-TREES IN 3-CONNECTED GRAPHS

被引：129

作者：

CHERIYAN, J ^{[1
]}

MAHESHWARI, SN ^{[1
]}

机构：

[1] INDIAN INST TECHNOL, DEPT COMP SCI & ENGN, NEW DELHI 110029, INDIA

来源：

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 1988年 / 9卷 / 04期

关键词：

D O I：

10.1016/0196-6774(88)90015-6

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：507 / 537

页数：31

共 19 条

[1]

Bollobas B., 1978, EXTREMAL GRAPH THEOR

[2]

Bollobas B, 1979, GRAPH THEORY

[3]

DOLEV D, 1984, 16TH P ACM STOC, P526

[4]

Even S., 1979, GRAPH ALGORITHMS

[5]

Harary F., 1972, GRAPH THEORY

[6] EFFICIENT PLANARITY TESTING [J].

HOPCROFT, J ;

TARJAN, R .

[7]

Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P135, DOI 10.1137/0202012

[8]

Itai A., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P137, DOI 10.1109/SFCS.1984.715910

[9]

LEMPEL A, 1966, THEORY GRAPHS INT S, P215

[10]

Linial N., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P39, DOI 10.1109/SFCS.1986.3