COLORING PLANAR GRAPHS IN PARALLEL

被引：12

作者：

BOYAR, JF ^{[1
]}

KARLOFF, HJ ^{[1
]}

机构：

[1] UNIV CHICAGO, DEPT COMP SCI, CHICAGO, IL 60637 USA

来源：

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 1987年 / 8卷 / 04期

关键词：

D O I：

10.1016/0196-6774(87)90046-0

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：470 / 479

页数：10

共 15 条

[1] EVERY PLANAR MAP IS 4 COLORABLE .1. DISCHARGING [J].

APPEL, K ;

HAKEN, W .

[2]

BEINEKE LW, 1978, SELECTED TOPICS GRAP, P118

[3]

BONDY JA, 1976, GRAPH THEORY APPLICA, P156

[4] A LINEAR 5-COLORING ALGORITHM OF PLANAR GRAPHS [J].

CHIBA, N ;

NISHIZEKI, T ;

SAITO, N .

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1981, 2 (04) :317-327

[5]

DIKS N, 1986, P MATH F COMPUTER SC

[6] ON LINEAR-TIME ALGORITHMS FOR 5-COLORING PLANAR GRAPHS [J].

FREDERICKSON, GN .

[7]

Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1

[8]

HARARY F, 1972, GRAPH THEORY, P104

[9]

Karloff H. J., 1985, THESIS U CALIFORNIA

[10]

KARLOFF HJ, IN PRESS J ALGORITHM