HYPERGRAPH PLANARITY AND THE COMPLEXITY OF DRAWING VENN-DIAGRAMS

被引：50

作者：

JOHNSON, DS ^{[1
]}

POLLAK, HO ^{[1
]}

机构：

[1] BELL COMMUN RES,MORRISTOWN,NJ

来源：

关键词：

D O I：

10.1002/jgt.3190110306

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：309 / 325

页数：17

共 19 条

[1] ON THE DESIRABILITY OF ACYCLIC DATABASE SCHEMES
BEERI, C
FAGIN, R
MAIER, D
YANNAKAKIS, M
[J]. JOURNAL OF THE ACM, 1983, 30 (03) : 479 - 513
[2] Berge C., 1973, GRAPHS HYPERGRAPHS, V7
[3] CORI R, 1973, THESIS U PARIS
[4] FUNDAMENTAL PROBLEM OF MATHEMATICS
ERDOS, P
[J]. AMERICAN MATHEMATICAL MONTHLY, 1972, 79 (02) : 149 - &
[5] FOURNIER JC, 1978, ACTES C ALGEBRE APPL
[6] Garey MR., 1979, COMPUTERS INTRACTABI
[7] AN ALGORITHM FOR CONSTRUCTING EDGE-TREES FROM HYPERGRAPHS
GAVRIL, F
TAMARI, R
[J]. NETWORKS, 1983, 13 (03) : 377 - 388
[8] AND WHAT IS YOUR ERDOS NUMBER
GOFFMAN, C
[J]. AMERICAN MATHEMATICAL MONTHLY, 1969, 76 (07) : 791 - &
[9] THE CONSTRUCTION OF VENN DIAGRAMS
GRUNBAUM, B
[J]. COLLEGE MATHEMATICS JOURNAL, 1984, 15 (03): : 238 - 247
[10] Harary F., 1969, GRAPH THEORY, DOI DOI 10.1201/9780429493768